Computer Chess Club Archives

Search

Messages

Subject: Position-Based "Learning"

Author: Stuart Cracraft

Date: 00:21:38 06/02/98

So what I hear is that having position-based "learning"
is something like saving the position after a really bad
drop in the iteration of a score in the hash table with
a special flag. When the game ends, write out all
such entries to a disk based file. When restarting
the program, read in the disk based file into the
hash table and set the flags. When searching, if
the position turns out to be one of those positions,
then what?

I could dig out my Slate (one or the other forgot which)
article in ICCA on the "Mouse" program -- is that essentially
what this Position-Based "Learning" is that some
programmers are using to create artificial wins against
other programs? If so, any big refinements to Slate's method
for the current crop? If no, what are the major differences
between Slate's method and the current vogue?

Thanks,
--Stuart

• Re: Position-Based Robert Hyatt 05:09:12 06/02/98
  • Re: Position-Based Roberto Waldteufel 11:02:13 06/02/98
    • Re: Position-Based Robert Hyatt 12:24:35 06/02/98
      • Re: Position-Based Stuart Cracraft 14:29:21 06/02/98
        • Re: Position-Based Robert Hyatt 18:35:49 06/02/98
        • Re: Position-Based Peter Fendrich 15:02:14 06/02/98
      • Re: Position-Based Komputer Korner 14:05:55 06/02/98
        • Re: Position-Based Robert Hyatt 18:38:29 06/02/98
  • Re: Position-Based Stuart Cracraft 07:13:35 06/02/98

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.