Author: Matthew Hull
Date: 05:45:32 01/27/03
Go up one level in this thread
On January 27, 2003 at 02:14:18, Sune Fischer wrote: >On January 26, 2003 at 21:56:47, Robert Hyatt wrote: > >>On January 26, 2003 at 12:05:31, Sune Fischer wrote: >> >>>On January 26, 2003 at 10:39:11, Robert Hyatt wrote: >>> >>>>On January 26, 2003 at 05:30:01, Roger D Davis wrote: >>>> >>>>>>Unless I have misunderstood the contract, this is a modified version of chess to >>>>>>that defined by the standard rules, which nowhere states that because one side >>>>>>knows that the game is drawn with perfect play then it shall be declared a draw >>>>>>- even if the other side does not know or cannot demonstrate it. >>>>> >>>>>Presumably then, Kasparov could show up with his own set of tablebases, and >>>>>consult them during the match? Maybe he has a particular ending he's weak in. Or >>>>>do only Junior's tablebases count? >>>> >>>> >>>>Kasparov can show up with anything he wants, "in his head". The computer is >>>>doing exactly the same. >>> >>>The computer doesn't have a head, so how can it be exactly the same? >>> >>>-S. >> >> >>Mine does. It has short-term memory, long-term memory, processing power, etc, >>all in _one_ "container". Just like _I_ do... > >So you _do_ think it's the same? Of course. So is book.lrn position.lrn. They are the same kinds of data, i.e. long term memory. It's not reasonable to make a program "forget" between games. Makes no sense. It's the same for programs that are nueral nets. Those nets are saved and retrieved from disk. Tis logical, yes? Matt > >-S.
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.