Implemented naive Monte Carlo move generator (simulates 10 random moves for 3 turns by each player).

Consequently, it performs strictly worse than Alpha-Beta, but usually avoids setting players up for an easy capture,
unlike Alpha-Beta.
This commit is contained in:
Woody Folsom
2012-04-29 14:59:25 -04:00
parent 744ceb02f7
commit 21e5d89447
5 changed files with 29 additions and 59 deletions

View File

@@ -39,6 +39,11 @@ public class ValidMoveGenerator implements MoveGenerator {
}
Collections.shuffle(validMoves);
return validMoves;
if (nMoves == MoveGenerator.ALL_MOVES) {
return validMoves;
} else {
return validMoves.subList(0, Math.min(validMoves.size(),nMoves));
}
}
}