Discussions of, papers on, and presentations about computer science and physical science theory
This section contains pseudocode of the algorithms used in the paper as well as a brief discussion of each algorithm.
This section outlines the algorithms used to generate the problems the various solving algorithms were tested against.
Conclusions regarding selected algorithms against the Sherlock and Zebra problems.
Bibliography and appendices for selected algorithms against the Zebra and Sherlock problems
How Artificial Intelligence can win at board games.
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.
Uses the basic principles of radioactive dating and combines them with advanced isotope measurements to obtain very precise results from small samples.
The binary constraint satisfaction problem (bcsp) is an important area of research because so many problems can be represented in this form [Kumar92].
What is in this article General Definitions Problem Definitions General Definitions arc consistency The domains of a variable Vi is such that for each constraint Ci,j Vi is consistent with the constraint for some permissible value of Vj for every value in the domain of Vi That is for every value x in Di (the domain of i) there exists some y in Dj such that Ci,j is satisfied. It is important to note that arc consistency is directional (that is (Vi , Vj ) being arc consistent does not mean (Vj , Vi ) is arc consistent).
