Game-independent Automatic Move/position-tree Exhaustive-Search, Manipulation And Navigation
Gamesman is the centerpiece of the GamesCrafters project. It provides a framework for our researchers to describe a board game in the C programming language. Once the description is completed, Gamesman can solve that game by evaluating every possible board position. Gamesman can then determine the value for each position, i.e. if a perfect player will win, lose, or tie against a perfect opponent. After the game has been solved and the value for every position is known, Gamesman allows the user to play against a perfect opponent, as well as optionally display information about who is winning. Combined with Gamesman's perfect knowledge about each possible move, the human player can then develop perfect strategies for playing the game. Gamesman also allows you to play many of our games using a graphical interface.
You can find all GamesCrafters projects here.
- Aaron Siegel's CGSuite (currently version 0.7 beta).
- Scheme code (
.scmfile) for a perfect hash for Rearranger-style games with one or two types of pieces.
There once was a prof known as Danny...
who couldn't play games worth a penny.
He wrote a small program...
that played them all fo' him.
Now he indeed seems quite canny!
— Daniel Horn, UC Berkeley class of 2003