Solving Checkers

نویسندگان

  • Jonathan Schaeffer
  • Yngvi Björnsson
  • Neil Burch
  • Akihiro Kishimoto
  • Martin Müller
  • Robert Lake
  • Paul Lu
  • Steve Sutphen
چکیده

AI has had notable success in building highperformance game-playing programs to compete against the best human players. However, the availability of fast and plentiful machines with large memories and disks creates the possibility of a game. This has been done before for simple or relatively small games. In this paper, we present new ideas and algorithms for solving the game of checkers. Checkers is a popular game of skill with a search space of possible positions. This paper reports on our first result. One of the most challenging checkers openings has been solved – the White Doctor opening is a draw. Solving roughly 50 more openings will result in the game-theoretic value of checkers being determined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Checkers is solved.

The game of checkers has roughly 500 billion billion possible positions (5 x 10(20)). The task of solving the game, determining the final result in a game with no mistakes made by either player, is daunting. Since 1989, almost continuously, dozens of computers have been working on solving checkers, applying state-of-the-art artificial intelligence techniques to the proving process. This paper a...

متن کامل

Efficiently Solving Bit-Vector Problems Using Model Checkers

Bit-precise reasoning is essential in many applications of Satisfiability Modulo Theories (SMT). Most approaches for solving quantifier-free fixed-size bit-vector logics (QF BV) rely on bit-blasting. In previous work, we have shown that bit-blasting is not polynomial in general [19], and later proposed QF BV 1, a class of bit-vector problems that is PSpace-complete [15]. In this paper, we give ...

متن کامل

Solving Nine Men's Morris

In recent years, a number of games have been solved using computers. These include Qubic [Patashnik 80], Connect-4 [Allen 89], [Allis 88] and Go-Moku [Allis 93]. All these games were solved using knowledge-based methods. These methods are successful because all these games have a low “decision complexity” [Allis 90], i.e., the right move is often easy to find. Not all games profit to the same e...

متن کامل

Puzzles for Learning Model Checking, Model Checking for Programming Puzzles, Puzzles for Testing Model Checkers

Paper discuss some issues related to model checking: (1) early model checking teaching via games, (2) utility of model checking and games for solving puzzles, (3) importance of games for validation of model checkers. Basic ideas are illustrated by a model checking based solution for a complicated puzzle how to identify a unique false coin among given ones balancing them limited times.

متن کامل

نگرانی و رابطه آن با زیرمجموعه ‏های وارسی و شستشوی اختلال وسواسی ـ اجباری

The aim of this research was to study worry and emotional processing indicators in individuals with OCD and to compare the checking and washing subtypes of this disorder. Sixty individuals with OCD (30 checkers and 30 washers) and 60 individuals as control (30 anxious and 30 normal) were selected and were matched in demographic characteristics with the checker group. The OCD were interviewed us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005