Abstract
Describes how the authors used genetic algorithms (GAs) to make a computer develop its own strategy in playing a simple board game. There are various types of games. John von Neumann and Oskar Morgenstern's Game Theory classifies games into several categories depending on the number of players involved, the presence or absence of the element of chance, the case that all players receive the same pieces of information or not and the type of payment function. The authors consider two-person zero-sum non-chance perfect-infermation games. Chess and checkers belong to this class.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
