Timeline for Which popular games are the most mathematical?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 10, 2015 at 22:17 | comment | added | Douglas Zare | In some games, computer programs evaluate positions, and choose to play the position with the highest evaluation, perhaps among a restricted set of candidates. Backgammon is an example. However, many competitive chess programs don't fit this description. Instead of evaluating positions they often directly choose the move to make, based on partial searches of the game tree that are affected by the amount of time left. A computer might try to spend ten seconds, quitting early if it finds a mate, but otherwise reporting its best candidate after that time. This might not be repeatable. | |
| Aug 8, 2012 at 6:11 | history | answered | user22202 | CC BY-SA 3.0 |