Computer Chess Club Archives

Search

Messages

Subject: Re: Here's an example.

Author: Robert Hyatt

Date: 15:58:51 04/18/00

Go up one level in this thread

On April 18, 2000 at 09:04:39, Mogens Larsen wrote:

>On April 17, 2000 at 22:02:20, Robert Hyatt wrote:
>
>>position learning only recognizes 'bad things' and inserts them into the
>>hash table so that if that game is played again, it will find the 'bad thing'
>>sooner and vary...
>
>Okay, I see. How difficult would it be implement something like a "this move
>worked the last time thing"? :o)
>
>Best wishes...
>Mogens


Not hard at all, but I'm not sure I would trust it as I make changes often
enough that old (one week) data values would be possibly way different...

• Re: Here's an example. Mogens Larsen 17:39:55 04/18/00
  • Re: Here's an example. Robert Hyatt 18:54:24 04/18/00
    • Re: Here's an example. Mogens Larsen 03:22:10 04/19/00
      • Re: Here's an example. Robert Hyatt 07:12:59 04/19/00
        • Re: Here's an example. Mogens Larsen 10:41:33 04/19/00
          • Re: Here's an example. Robert Hyatt 15:37:47 04/19/00
            • Re: Here's an example. Mogens Larsen 15:50:20 04/19/00
              • Re: Here's an example. Jeremiah Penery 21:12:16 04/19/00
                • Re: Here's an example. Mogens Larsen 02:20:25 04/20/00

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.