Alex_Moiseyev wrote:In terms of perfectness and "solving checkers" we should probably address several statements and see in which one program hits.
1. Proof that program always makes best move and don't miss any wins or draws.
2. Proof that program handles properly each position in 24 pieces ending databas.
3. Proof that program don't lose in 2-moves and 3-moves games.
4. Proof that program today plays better than any other program and human.
5. Proof that program don't lose in GAYP.
As of today we should say that checkers were solved only at the lowest level - #5.
I had a phone call from New York Times when Chinook Team made announcement about solving checkers. They didn't want to find a true, but continue to ask one question only: "Checkers were solved ?"
1. Proof that program always makes best move
My move is 11-15 ... Where is your move ?George Hay wrote:W.T. Call adds, "The theoretical conclusion that every game of checkers should end in a draw is supported by the facts of experience."
11-15 22-18 15x22 ... I have several couple questions regarding this specific order of moves in database(s):George Hay wrote:My reply is 22-18, but not everyone would agree!
It seems to me that opening theory is still, well wide open! The mapping out of the game of checkers is part of the charm. It will take a 24-piece database to "settle" some questions, and perhaps "strongly" solve checkers!
Even then there is still the psychology of this great mind sport!
Users browsing this forum: No registered users and 1 guest