Title here
Summary here
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.
August 20, 2021 by Daniel F Dickinson1 minute
Ancient games, old computers, and 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.
May 23, 2022 by Daniel F Dickinson1 minute
A Study of the Sherlock and Zebra problems: Intro
The binary constraint satisfaction problem (bcsp) is an important area of research because so many problems can be represented in this form [Kumar92].
February 9, 2003 by Daniel F Dickinson2 minutes
Definitions for Zebra and Sherlock
Various definitions for testing selected algorithms against the Zebra and Sherlock problems, viewed as a binary constraint satisfaction problem
February 9, 2003 by Daniel F Dickinson6 minutes
Algorithms for solving Zebra and Sherlock
This section contains pseudocode of the algorithms used in the paper as well as a brief discussion of each algorithm.
February 9, 2003 by Daniel F Dickinson14 minutes
Generate random problems
This section outlines the algorithms used to generate the problems the various solving algorithms were tested against
February 9, 2003 by Daniel F Dickinson6 minutes
Results for solving Zebra and Sherlock
Conclusions regarding the testing of selected algorithms against the Sherlock and Zebra problems, when handled as a binary constraint satisfaction problem.
February 9, 2003 by Daniel F Dickinson5 minutes
Bibliography and Appendices
Bibliography and appendices for a project on testing selected algorithms against the Zebra and Sherlock problems
February 9, 2003 by Daniel F Dickinson6 minutes