Article View: sci.logic
Article #416Re: "Solvability" in Chess
From: Victor Allis
Date: Tue, 29 Sep 1992 09:30
Date: Tue, 29 Sep 1992 09:30
17 lines
1163 bytes
1163 bytes
keith@cco.caltech.edu (Keith Allan Schneider) writes: >What about simpler games, such as checkers, or othello. Has anyone "solved" >these? Checkers and Othello have not been solved. Jonathan Schaeffer is working hard on Checkers, and if anyone will solve it before 2000 it will probably be him (although I feel that the game will last longer than 2000). Othello, in my opinion will not be solved for quite some time, certainly not before 2000. The only solved non-trivial games so far are Connect-Four (1988) Qubic (1980, 1991) and Go-Moku (1992). Victor Allis.
Technical Details
Message-ID:
<1992Sep29.093031.14242@cs.rulimburg.nl>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!uknet!mcsun!sun4nl!rlmix1.rulimburg.nl!cs.rulimburg.nl!allisReferences:
<1992Sep24.055117.13187@raven.alaska.edu> <xeno.717323625@pv34ad.vincent.iastate.edu> <19s2bbINNcqi@agate.berkeley.edu> <92268.131756RVESTERM@vma.cc.nd.edu> <19uao4INN615@gap.caltech.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!agate!doc.ic.ac.uk!uknet!mcsun!sun4nl!rlmix1.rulimburg.nl!cs.rulimburg.nl!allis From: allis@cs.rulimburg.nl (Victor Allis) Newsgroups: sci.logic,sci.math,rec.games.chess Subject: Re: "Solvability" in Chess Message-ID: <1992Sep29.093031.14242@cs.rulimburg.nl> Date: 29 Sep 92 09:30:31 GMT References: <1992Sep24.055117.13187@raven.alaska.edu> <xeno.717323625@pv34ad.vincent.iastate.edu> <19s2bbINNcqi@agate.berkeley.edu> <92268.131756RVESTERM@vma.cc.nd.edu> <19uao4INN615@gap.caltech.edu> Organization: University of Limburg Lines: 17