Hot answers tagged

1

For such problem I'd rather go for a Montecarlo algorithm. For each possible move make N random plays and count the number of computer wins. Let the computer do the move with the higher number of wins. N should be sufficiently large. The larger that number, the strongest the computer will be Doing this way the computer will force the game into the ''path'' ...



Only top voted, non community-wiki answers of a minimum length are eligible