First Page | Document Content | |
---|---|---|
![]() Date: 2005-07-08 01:58:21Tic-tac-toe Strategy-stealing argument Qubic Solved game Achi Determinacy Positional game M n k-game Hales–Jewett theorem Games Abstract strategy games Mathematical games | Source URL: www.austms.org.auDownload Document from Source WebsiteFile Size: 719,71 KBShare Document on Facebook |
![]() | On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms Fabien Teytaud and Olivier Teytaud Abstract—Monte-Carlo Tree Search (MCTS) algorithms, including upper confidence Bounds (UCT), have very goodDocID: 1ng5w - View Document |
![]() | PDF DocumentDocID: 17doX - View Document |
![]() | Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games Umair Z. Ahmed Krishnendu ChatterjeeDocID: ZHxo - View Document |
![]() | Evolutionary Game Design Cameron Browne Computational Creativity Group Imperial College London “Humies” entryDocID: neUx - View Document |
![]() | Norman Do How to Win at Tic-Tac-Toe 1DocID: 1Z2A - View Document |