"Tom Jones" <email@example.com> wrote in message
> I've used MiniMax trees in the past, but I have run into a kink while
> applying them to the game of Othello (Reversi).
> Othello differs, from a game like chess, in that you can leave your
> opponent ZERO moves and yet the game is not over. I am not sure how to
> represent this "forced pass" in the game tree.
> For example I am building the tree and run into a situation where it is
> Player B's turn to move, but he has no moves and yet Player A DOES have
> moves from this position.
> Any help would be appreciated!
Just add a 'special' move for B that doesn't alter the board state.
That way you don't have to alter the a-b code to watch for holes.