Author: Robert Hyatt
Date: 18:35:49 06/02/98
Go up one level in this thread
On June 02, 1998 at 17:29:21, Stuart Cracraft wrote: >On June 02, 1998 at 15:24:35, Robert Hyatt wrote: > >> >>my position file has 65536 entries, and is "wrap-around" once it fills >>up in a FIFO ring buffer. However, I *never* let it fill up, because I >>delete it regularly. >> > >Why do you delete it regularly? Seems to me there's valuable >"experience" >in that file. Why not add a field "frequency" that shows how frequently >in >real games the given position has been visited. Then, when the file >fills >up and becomes a burden to the regular hash table, clean out the ones >with >frequency=some_low_number? > because crafty is not static. And as the evaluation or search or speed improves, the values become meaningless. This kind of learning will *not* improve the program significantly. It will prevent you from walking into a 1. h3 and 2. a3 opening that takes you out of book, and then you play the same game over and over, losing every time. this will change the moves significantly in identical openings... >> >>this sort of learning was added so that if someone finds a quick exit >>out >>of book, book learning won't work. This at least gives it a chance to >>not >>play into the same lost game over and over. I only learn positions from >>the first 10 non-book moves before turning it off... > >Someone forcing the program to play the same lost game over and over >whenever the same opening moves are played is a significant problem >especially when having a program play on the Internet Chess Server or >in a computer vs. computer tournament. I've seen it a few times and am >sure you've seen it quite a bit. Kinda negates the value of the server >for testing research if some joe knows how to get free rating points >without really beating the program each time. > >--Stuart this was a comment Ed had about book learning a couple of years ago. My response was "if doubles are a problem, then rather than depending on others to solve your problem for you (eliminating doubles), solve it yourself by taking action yourself. This is one way to circumvent losing the same game over and over, which is a standard IM/GM tactic on the servers. It simply doesn't work with Crafty...
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.