The Game of Hex: An Automatic Theorem Proving Approach to Game Programming

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 189-194

  Anshelevich, Vadim V ^a  

^a Vanshel Consulting   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER GAMES; GAME THEORY; THEOREM PROVING;

AUTOMATIC THEOREM PROVING; BRANCHING FACTORS; GAME PROGRAMMING; GAME TREE SEARCH; NEW APPROACHES; OTHELLO; SEARCH TECHNIQUE; SIMPLE++; TOPOLOGICAL ANALYSIS; TWO-PLAYER GAMES;

TREES (MATHEMATICS);

EID: 85158171964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Adelson-Velskiy, G.; Arlazarov, V.; and Donskoy, M. 1975. Some Methods of Controlling the Tree Search in Chess Programs. Artificial Intelligence 6(4):361-371.
2. Berlekamp, E. R.; Conway, J. H.; and R. K. Guy, R. K. 1982. Winning Ways for your Mathematical Plays. New York: Academic press.
3. Gale, D. 1979. The Game of Hex and the Brouwer Fixed-Point Theorem. American Mathematical Monthly 86: 818-827.
4. Gardner, M. 1959. The Scientific American Book of Mathematical Puzzles and Diversions. New York: Simon and Schuster.
5. Junghanns, A.; Schaeffer J. 1998. Single-Agent Search in the Presence of Deadlock. AAAI'98 419-424.
6. Marsland, T. A. 1986. A Review of Game-Tree Pruning. Journal of the International Computer Chess Association 9(1):3-19.
7. Schaeffer, J.; Lake, R.; Lu, P.; and Bryant M. 1996. Chinook: The World man-Machine Checkers Champion. AI Magazine 17(1):21-29
8. Shannon, C. E. 1953. Computers and Automata. Proceedings of Institute of Radio Engineers 41: 1234-1241