1,277
edits
Changes
→Methods: -bb – updating in light of recent coding
/* Andrew? */
// generates an array of Gameboards of all the possible moves from the current Gameboard g for a given player. returns an array of Gameboards
----
/* Paul? */ // evaluates an array of gameboards all possible moves to be generated from the '''this''' board using the minimax algorithm and alpha-beta pruning. // if necessary, generates additional move levels (i.e. if none of the gameboards in this array result in continues searching until it reaches '''depth''' or a win), whichever comes first Move evalTree(Gameboard[] arrint color, int depth)
----
/* Jordan? */
// evaluates the given network for a winning color
// returns the a probability of winning color (as Chip.color), -10 if there is no winnerwin // '''NOTE''': we need to figure out how to rate a board that doesn't win and we're already at the lowest level – some sort of probability techniquereturns 999 if WHITE wins, how many connections there are with the current chips, etc....-999 if BLACK wins
int winner(Gameboard g)