In this competition game rules are described using a language called GDL (http://en.wikipedia.org/wiki/Game_Description_Language). Broadly there are two approaches. Super fast Monte-Carlo tree searches and algos which, from rules, infer game-state heuristics which are used in more traditional depth-limited search.
Re:A Python AI for two-player board games
by sehugg on Monday December 23, 2013 @05:12PM
(#6956862)
Very nice, the examples are very clear and terse.
I started on a similar project in C which is unique in that the game logic is written more-or-less procedurally and the library takes care of backtracking the game state to iterate through the tree nodes:
Re:A Python AI for two-player board games
by gamegoblin on Monday December 23, 2013 @03:34PM
(#6956376)
Negamax is very good for a wide variety of relatively simple games. It will utterly fail for Go, but I've written negamax AIs that dominate any casual player at chess, connect 4, reversi, gomoku, etc. They become yet stronger if you add a quiescence search.
Here's the code: https://github.com/dangoldin/connect4bot
And here's a writeup: http://dangoldin.com/2013/11/30/genetic-programming-connect-...
In this competition game rules are described using a language called GDL (http://en.wikipedia.org/wiki/Game_Description_Language). Broadly there are two approaches. Super fast Monte-Carlo tree searches and algos which, from rules, infer game-state heuristics which are used in more traditional depth-limited search.
General Game Playing: https://www.coursera.org/course/ggp
they were using java/javascript for their players. And there were other issues making their framework a little bulky
I started on a similar project in C which is unique in that the game logic is written more-or-less procedurally and the library takes care of backtracking the game state to iterate through the tree nodes:
https://github.com/sehugg/Starthinker