Article View: sci.logic
Article #422Go-Moku solved? [thankfully not Re: "Solvability" in Chess]
From: Noam Elkies
Date: Tue, 29 Sep 1992 17:17
Date: Tue, 29 Sep 1992 17:17
17 lines
1355 bytes
1355 bytes
In article <1992Sep29.093031.14242@cs.rulimburg.nl> allis@cs.rulimburg.nl (Victor Allis) writes: >The only solved non-trivial games so far are Connect-Four (1988) >Qubic (1980, 1991) and Go-Moku (1992). > ^^^^^^^ This is news to me. Was this with or without the constraint that the first player may not win by 3&3 unless forced to by a direct threat? Who found the solution? Does this mean Pente is also solved or nearly solved? --Noam D. Elkies (elkie@zariski.harvard.edu) Dept. of Mathematics, Harvard University P.S. And what's the meaning of the curious date "1980, 1991" for the solution of Qubic? Was a hole in the 1980 argument found and patched a decade later?
Technical Details
Message-ID:
<1992Sep29.131709.15945@husc3.harvard.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!caen!kuhub.cc.ukans.edu!husc-news.harvard.edu!ramanujan!elkiesReferences:
<92268.131756RVESTERM@vma.cc.nd.edu> <19uao4INN615@gap.caltech.edu> <1992Sep29.093031.14242@cs.rulimburg.nl>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!ogicse!uwm.edu!caen!kuhub.cc.ukans.edu!husc-news.harvard.edu!ramanujan!elkies From: elkies@ramanujan.harvard.edu (Noam Elkies) Newsgroups: sci.logic,sci.math,rec.games.chess Subject: Go-Moku solved? [thankfully not Re: "Solvability" in Chess] Keywords: Go-Moku, Qubic Message-ID: <1992Sep29.131709.15945@husc3.harvard.edu> Date: 29 Sep 92 17:17:08 GMT Article-I.D.: husc3.1992Sep29.131709.15945 References: <92268.131756RVESTERM@vma.cc.nd.edu> <19uao4INN615@gap.caltech.edu> <1992Sep29.093031.14242@cs.rulimburg.nl> Organization: Harvard Math Department Lines: 17 Nntp-Posting-Host: ramanujan.harvard.edu