Author: Frank Phillips
Date: 05:53:43 05/28/01
Go up one level in this thread
On May 28, 2001 at 07:33:14, Daniel Vachon wrote: >Hi Frank, >Congrats on your result. I'd just like to say that I pretty much agree with >Steve Timson on this one. >If you want to get rid of any foolish rumors I suggest (and this is only a >suggestion) to send a copy of your program to Frank Q. The program will be safe >with him and he will play around with it lots,hopefully putting many peoples >mind at ease. My mind is already at ease of course :) > >And congrats once again! >Great Stuff! I can probably think about sending the executable. But never intended to do this yet. The init file has some instructions on what to do (see below) because I forget, but no documnetation to speak of yet. Searcher relies on Nalimov EGTBs for endgame so I will have to have to ask Eugene's permission before distributing I guess. Opening books will probably also need to be generated by the user. It is very primitive relying on ram or very slow using disk. Frank # Searcher.init # A plain text file for setting user perferences in Searcher. # Lines starting with a # are comments. # # book file is the name of the opening book. Different books could # be used, perhaps for trying specific openings, for example. # If a full path name is not given then the book is assumed to be # in the same directory as Searcher. # #bookfile ./books/new.book #bookfile ./books/april2001.book bookfile ./books/enormous.book bookfile_preferred_white ./books/white.pref bookfile_preferred_black ./books/black.pref use_preferred_books 1 # # Set the book width, which determines the maximum number of possible # book moves the program randomly choses from in opening positions. # book_width 4 # # Additonal (finer) control. Set number of times book positions must # have occured to be considered. # book_min_games 4 # # Hash table size in 2^number_of_records. There are three hash tables. # Each record is 16bytes so a setting of 20 needs about (2^20)*16*3=48MBytes. # #HashTable 22 HashTable 23 #HashTable 0 # # Pawn hash table. Each record is 32 bytes and there is one table. # #PawnTable 19 PawnTable 20 #PawnTable 0 # # Settings for endgame database table. egtb_path is where the # tables can be found. # egtb_cache is the amount of RAM in MB to use as cache. # #egtb_path D:/CompressedTb egtb_path /Chess/CompressedTb egtb_cache 8 # # Directory where program writes search statistics. # Note that any directories listed must already exist. # Set one_logfile to 1 to prevent program writing a new log # and game file for each new game. # log_path ./log one_logfile 0 # # Filename where program writes completed game. # Set to none to prevent game files being written. # game_filename none # #game_filename ./ics.pgn game_filename ./CCT3.pgn #game_filename none #game_filename ./trash.pgn # #Set ics_whisper=1 to whisper information to chess server. # #ics_whisper 1 ics_whisper 0 # # Set accept_draw to 1 if you want Searcher to ALWAYS accept # a draw offer, otherwise 0 - when Searcher will decide for itself. # accept_draw 0 # # Setting contempt negative will cause the computer to try # to avoid draws. Positive will make draws more attractive. # Zero is normal. 30 is equivalent to 1/3 of a Pawn. # contempt 0 # # #Set number of hash records (in power of 2) for use in makebook(). # Note that Windows98 can only access 512MB in total including swap file. # make_book_size 25
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.