> Can anyone point me in the right place in the > GNU backgammon source or anywhere else that will > help show me the algorithm used when a player has > the ability to use both dice, but attempted to use > only one?
Using lot's of if statements fails totally. In GNU Backgammon we use a 'recursive' algorithm to find all legal moves. it looks at submoves with only one die. Look at the code GenerateMoves() in eval.c. See also: http://www.bkgm.com/rgb/rgb.cgi?view+593 For cheching if a resulting position is legal. -Oystein _______________________________________________ Bug-gnubg mailing list [email protected] http://lists.gnu.org/mailman/listinfo/bug-gnubg
