Author: leonid
Date: 14:08:01 11/18/00
Go up one level in this thread
On November 18, 2000 at 15:48:12, Timothy J. Frohlick wrote: >On November 18, 2000 at 13:39:39, Jorge Pichard wrote: > >>Does anybody know which programs use which method and which aproach is yielding >>a better result? > >All of todays chess programs use various forms of selective search. Our >processors could not even begin to do full-width and complete 14 ply searches. >Brute force machines would need processors and memory millions of times as much >as even the Pentium IV 1.5 Ghz machines that just arrived today. As far as I know heavy position could be taken by brute force in few seconds on 1.5 Ghz only 8 plys deep. Heavy position - average 35 nodes in each ply. 8 ply search is too little. At least, actual computer must be able to reach some 12 plys to make brute force search practical. We are still not there. >Full width or "brute force" is not a smart way to play chess. Kramnik and >Kasparov are not brute force players. Brute force is not affordable way of playing. This is only reason why it look like very poor. This impression could become different only in some 30 years from now. We are still playing with computers of Stone Age. Leonid. >Tim Frohlick
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.