Author: Georg v. Zimmermann
Date: 13:36:04 04/11/00
Go up one level in this thread
On April 10, 2000 at 19:27:16, Ian Osgood wrote: >On April 06, 2000 at 15:09:10, David Paulowich wrote: > >>On April 05, 2000 at 16:15:52, Jonathan Lee wrote: >> >>>I have two above average 3 dimensional tic tac toe programs (4x4x4), but they >>>are beatable. >>>Is there a program out there when the computer moves first, the computer never >>>loses? >>>Jonathan (35th message) >> >>I believe someone proved that the 4x4x4 game is a forced win for the >>first player. If true, there may be a program that always wins. >> >> - David > >Victor Allis has solved this game along with a few others (Connect 4) in the >process of doing his thesis on Proof-Number search. > >No, Proof-Number search will not revolutionize computer chess. :) It is >suitable for exploring game trees which have results dependent on very long >mostly-forced variations. It is an interesting technique for some subgames of >Go, suicide chess, and games with small overall game-spaces such as Connect 4 >and 4x4x4 tic-tac-toe. > >Ian Where can I get some info on Proof Number search ? Thx --
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.