Abstract
In the paper, an approach to programming of nondeterministic antagonistic games is considered. This approach may be viewed as a generalization of the classical approach used for deterministic games (chess and the like) and is alternative to neural network methods of programming, which are usually applied to nondeterministic games. As examples of nondeterministic games, the very simple game omega and classical backgammon are considered. Results of programming these games are briefly discussed.
Full Text
Published Version
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