Author: Thorsten Czub
Date: 14:05:19 01/04/98
Go up one level in this thread
>The selective part tends to end after a computer's move, which gives >line lengths that are a multiple or 2 PLUS 1(not "power of 2"). For >example you'll mostly see lines of length 3, 5, 7, 9, 11, ... Maybe >another asymetry here: threats against the program are extended, but the >program doesn't care very much about threats it can do on the opponent >(except checks, maybe). > >The goal of the selective search seems to be: show that the position >reached by the full width search is safe for the program. > >I'm not absolutely sure of all of this. This is data under discussion... > > > Christophe Hi - I have found the paper we wrote in Paris on the hotel-room: Genius5, 1 ply search-depth fixed, varying levels of selectiveness, no hash, no learning, no book: 0: e4 e5 2 1+1 (2 to power 0) +1 2: e4 d5 Nc3 3 2+1 (2 to power 1) +1 4: Nf3 d5 d4 3 6: Nf3 d5 d4 3 8: Nf3 d5 d4 3 10: e4 e5 Nf3 Nc6 Bc4 5 4+1 (2 to power 2) +1 12: e4 e5 Nf3 Nc6 Bc4 5 genius gets reasonable main-lines with 1 ply search-depth. Maybe the length of the main line is pure randomn. But I don't think so. We have tried to find the PATTERN for the main-line for search-depths of 2 and further. But it was late and we were tired. Fact is the main lines looked the following way for ply 2 search: 0: Nf3 e6 d4 3 2: Nf3 e6 d4 3 4: d4 d5 Nf3 Nf6 Bf4 5 6: d4 d5 Nf3 Nf6 Bf4 5 8: d4 d5 Nf3 Nf6 Bf4 5 10: e4 e5 Nf3 Nc6 Bc4 5 12: e4 e5 Nf3 Nc6 Bc4 5 Any ideas ?
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.