Theory
- Board game winning AI
A presentation about how Artificial Intelligence can win at board games, which Daniel F. Dickinson presented during a Virtual Maker Meeting.
- Ancient games, new tech
About a member of the Mancala family of games known as Oware or Wari, with a look at an old Commodore 64 version as well as modern versions.
- Intro to Sherlock
The binary constraint satisfaction problem (bcsp) is an important area of research because so many problems can be represented in this form [Kumar92].
- Definitions for BSCPes
Various definitions for testing selected algorithms against the Zebra and Sherlock problems, viewed as a binary constraint satisfaction problem
- Algorithms to solve BCSPes
This section contains pseudocode of the algorithms used in the paper as well as a brief discussion of each algorithm.