Strategies for the automatic construction of opening books

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2063, Issue , 2001, Pages 74-86

  Lincke, Thomas R ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Awari; Best first; Expansion strategy; Opening book construction; Othello

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTOMATIC CONSTRUCTION; AWARI; BEST-FIRST; BEST-FIRST STRATEGY; BRUTE FORCE SEARCH; EXPANSION STRATEGIES; IMPORTANT FEATURES; OTHELLO;

COMPUTER GAMES;

EID: 84958750318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_5     Document Type: Conference Paper

References (10)

1. L.V. Allis. Searching for Solutions in Games and Artificial Intelligence. PhD thesis, University of Limburg, Maastricht, The Netherlands, 1994.
2. M. G. Brockington. KEYANO Unplugged - The Construction of an Othello Program. Technical Report 97-05, Department of Computing Science, University of Alberta.
3. M. Buro. Toward Opening Book Learning. ICCA Journal, 22(2): 98-102, 1999.
4. R. U. Gasser. Harnessing Computational Resources for Efficient Exhaustive Search. PhD thesis, ETH Zürich, 1995.
5. R. M. Hyatt. Book Learning - A Methodology to Tune an Opening Book Automatically. ICCA Journal, 22(1): 3-12, 1999.
6. D. A. McAllester. Conspiracy Numbers for Min-Max Search. Artificial Intelligence, 35: 287-310, 1988.
7. J. Schaeffer. Conspiracy Numbers. Artificial Intelligence, 43: 67-84, 1989.
8. J. Schaeffer, R. Lake, P. Lu, and M. Bryant. Chinook: The World Man-Machine Checkers Champion. AI Magazine, 17(1): 21-29, 1996.
9. K. Thompson. Retrograde Analysis of Certain Endgames. ICCA Journal, 9(3): 131-139, 1986.
10. R. van der Goot and T. R. Lincke. Marvin WinsAwari Tournament. ICGA Journal, 23(3): 173-174, 2000.