Jonathan Schaeffer and Robert Lake. Solving the game of checkers. Math. Sci. Res. Inst. Publ., 29:119--133, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Representations Of And Strategies For Static Information.. - Bart (2000) (1 citation) (Correct)
....Intelligence (AI) research, but the computers of the era were not fast enough to compute the existing heuristics in reasonable time. However, with the advancing speed of supercomputers, we have witnessed computer programs triumph at the world championship level in checkers with Chinook [17] [18] and in chess with Deep Blue [12] 19] These recent triumphs have restimulated research in game playing. Checkers and chess are representatives from the class of games with perfect information. 1 CHAPTER 1. INTRODUCTION 2 Informally, perfect information means that at any point during the game, ....
Jonathan Schaeffer and Robert Lake. Solving the game of checkers. Math. Sci. Res. Inst. Publ., 29:119--133, 1996.
Go Patterns Generated by Retrograde Analysis - Bouzy (Correct)
....technique of positions in two player, complete information games. In Chess [Thomson 1986] retrograde analysis enabled researchers to generate all six piece positions [Thomson1996] and most of seven or eight piece positions [Nalimov al. 2000] In Checkers, this technique is used by Chinook [Schaeffer Lake 1996]. In Awari [Lincke Marzetta 2000] Kalah [Irving al 2000] and Nine Men s Morris [Gasser 1996] retrograde analysis was used to solve these games. In Go, Zobrist 1969] Benson 1976] Boon 1989] Berlekamp Wolfe 1994] Chen Chen 1999] Wolf 2000] have been the most important publications ....
....be inserted. But the combinatorial price to pay for this insertion, increases too quickly indeed with the size of the patterns, and it forbids such insertion into current computers. Retrograde analysis has been used to solve games [Gasser 1996] Lincke Marzetta 2000] Irving al 2000] [Schaeffer Lake 1996]. In this context, for each size and kind of board piece, the table below gives the game value of the initial position of the associated game and the number of positions taking symmetry, rotations and inversion into account. The gray boxes have not been calculated by our study. size 1x1 2x2 3x3 ....
Jonathan Schaeffer, Robert Lake, "Solving the game of checkers", Games of no chance, MSRI Publications, Vol. 29, Novakowski (eds.), Cambridge University Press, pp. 119-133, 1996.
Solving Games with Distributed Computing: A System for Network RAM - Davidson (2000) (Correct)
....Solving Games In solving a game, it must be proven that the game is a win, loss, or draw for the players. In other words, one wishes to determine the game theoretic value of a position, or in some cases, any arbitrary position. Schae er et al. give four classi cations for game theoretic solutions [9]. 1 An ultra weak solution is a proof of the theoretical outcome of a game, but o ers no strategy for doing so. For instance the game of Hex has a simple mathematical proof that the game is a win for the rst player, yet there is no known strategy to accomplish this in practice. A weak solution ....
....ancient African game played with pebbles and pits. Like Chinook, it also uses a large endgame database [10] It is believed that solving Awari may also be tractable provided the program is not perpetually I O bound. Awari has a search space of roughly 10 12 positions, while checkers has 10 20 [9]. Awari may be the rst game the GAMES group will attempt to solve, before moving on to the more challenging checkers problem. Awari starts with 48 stones on the board, and stones are gradually removed from the board as the game progresses. The player to capture the most stones wins the game. The ....
Jonathan Schae er and Robert Lake. Solving the game of checkers. In Richard J. Nowakowski, editor, Games of No Chance, pages 119-133. Cambridge University Press, 1996.
The usability of Java for developing parallel applications - Dewanchand, Blankendaal (Correct)
....29] 8.2. 3 Evaluation function Since Cilk s tree node game position evaluation function was rather primitive (counting the number of checkers and kings and multiplying each with a predefined value) we decided to add some more advanced heuristic components based on Chinook s evaluation function [21, 22]. Our function incorporates the checker advancement heuristic, and takes back row occupation and piece centering in consideration as well to improve the application s level of play. 26 Client Server Registry Engine CPU Position Depth Best move Creation Bind Lookup EngineInterface ....
Jonathan Schaeffer, R. Lake. Solving the Game of Checkers. Edmonton, Canada.
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