Author: Don Dailey
Date: 16:45:20 08/23/98
Go up one level in this thread
On August 21, 1998 at 23:55:07, blass uri wrote: >I think it can be a good idea to do a tournament of programs when >every game between 2 computer programs will be replayed 3 times: >1 time when both program have an opening book. >1 time when only white has an opening book. >and 1 time when only black has an opening book. > >By this tournament we can estimate the value of the books opening in elo. > >Uri A reasonable idea. I have another idea for those situations where you want to play long matches between just 2 machines to minimize the effect of killer books. It's certainly not a new idea but a reasonable one I think. You simply determine in advance how deep you can go in the openings and then not allow duplicate games beyond this point. For instance if you decide 8 moves provide adequate variety, then the first time another game duplicates within the first 8 moves, (even if the result is different) then you throw out the 2nd game and start over until you get another unique opening. An opponent can still optimize but this becomes much more difficult to do and the opponent program will have to take more chances to do it right like having to put weaker moves in his book to bait a specific opponent. Another similar idea is to decide in advance how many games should be in the match (n) and play 2n games. Use the above idea but determine what number of moves is just big enough to not exclude too many games. This has the merit of not having to figure this out in advance but requires much more testing overhead. - Don
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.