Building the Checkers 10-Piece Endgame Databases

作者: J. Schaeffer , Y. Björnsson , N. Burch , R. Lake , P. Lu

DOI: 10.1007/978-0-387-35706-5_13

关键词:

摘要: In 1993, the Chinook team completed computation of 2 through 8-piece checkers endgame databases, consisting roughly 444 billion positions. Until recently, nobody had attempted to extend this work. November 2001, we began an effort compute 9- and 10-piece databases. By June 2003, entire 9-piece database 5-piece versus portion were completed. The result is a 13 trillion position database, compressed into 148 GB data organized for real-time decompression. This represents largest initiative yet attempted. results obtained from these computations are being used aid attempt weakly solve game. paper describes our experiences working on building large

参考文章(10)
John W. Romein, Henri E. Bai, AWARI IS SOLVED ICGA Journal. ,vol. 25, pp. 162- 165 ,(2002) , 10.3233/ICG-2002-25306
Thomas R. Lincke, Ambros Marzetta, LARGE ENDGAME DATABASES WITH LIMITED MEMORY SPACE ICGA Journal. ,vol. 23, pp. 131- 138 ,(2000) , 10.3233/ICG-2000-23302
L.V. Allis, Searching for solutions in games and artificial intelligence Ph. D. Thesis, University of Limburg. ,(1994)
E. Trice, G. Dodgen, THE 7-PIECE PERFECT PLAY LOOKUP DATABASE FOR THE GAME OF CHECKERS advances in computer games. pp. 211- 230 ,(2004) , 10.1007/978-0-387-35706-5_14
Mark Goldenberg, Paul Lu, Jonathan Schaeffer, TrellisDAG: A System for Structured DAG Scheduling job scheduling strategies for parallel processing. pp. 21- 43 ,(2003) , 10.1007/10968987_2
Andrew Turpin, Alistair Moffat, Practical length-limited coding for large alphabets The Computer Journal. ,vol. 38, pp. 339- 347 ,(1995) , 10.1093/COMJNL/38.5.339
Ralph Gasser, SOLVING NINE MEN'S MORRIS computational intelligence. ,vol. 12, pp. 24- 41 ,(1996) , 10.1111/J.1467-8640.1996.TB00251.X
J.W. Romein, H.E. Bal, Solving awari with parallel retrograde analysis IEEE Computer. ,vol. 36, pp. 26- 33 ,(2003) , 10.1109/MC.2003.1236468