A. S. Fraenkel. Combinatorial games: Selected bibliography with a succinct gourmet introduction. Electronic Journal of Combinatorics, 1994. Dynamic Survey DS2, http://www.combinatorics.org/Surveys/. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Investigation, using Co-Evolution, to Evolve an Awari Player - Davis, Kendall (2002) (1 citation) (Correct)
....and to show that it can evolve its own strategies. Co evolution is used to develop Anaconda, by playing games against itself. Anaconda has achieved expert levels of play (ratings of over 2000) Both checkers and chess are games of perfect information, otherwise known as combinatorial games [9]. These games are classified as two player games, with no hidden information, no chance moves, a restricted outcome (win, lose and draw) and with each player moving alternately. This is different to games such as poker [10] 11] 12] backgammon [13] 14] 15] 16] or bridge [17] 18] ....
A. S. Fraenkel, "Combinatorial Games : Selected Bibliography with a Succinct Gourmet Introduction", Games of No Chance, Vol. 29, MSRI Publications, Cambridge University Press (ed. R. Nowakowski), pp 493-537, 1996
Playing Games with Algorithms: Algorithmic Combinatorial Game.. - Demaine (2001) (5 citations) (Correct)
No context found.
A. S. Fraenkel. Combinatorial games: Selected bibliography with a succinct gourmet introduction. Electronic Journal of Combinatorics, 1994. Dynamic Survey DS2, http://www.combinatorics.org/Surveys/.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC