Began work on the AI algorithm. It is not currently working. Just figured out that we will need to pass the probability ranksets down into the recursion of the planning algorithm. Also, luckily, we don't need to do A*. We can simply use the distance formula.
Added most all the code required for the min-max algorithm. Should be good to go, but haven't run it yet. Going to take a lot of testing to get this to work right.
Continued work. Got more stuff done. Figured out the probability weighting for the minmax algorithm. Next I need to implement a Battle class that contains the three different outcomes for win, loss, and tie as well as their respective probabilities.
Added probOfTieing and probOfLosing functions. Updated probOfWinning to not include the Flag in the ranks we'd lose to. Commented out getDefinitePieces in the probOfWinning function since we aren't using it anywhere yet.
Continued work on algorithm. Fixed all syntax errors. Beginning work on logical bugs.
Merge branch 'issue/implement_AI' of github.com:Cewdyn/software-dev into issue/implement_AI
Removed Nate's RUDE comment blocks. Synta errors are fixed, ALRIGHT?
Added back in Tyler's move algorithm for testing while Dan's algo is under construction. Commented out Dan's algo call.