Computer Chess Club Archives




Subject: Re: Crafty CCT6 notes

Author: Sune Fischer

Date: 07:29:19 02/02/04

Go up one level in this thread

On February 02, 2004 at 08:38:26, Uri Blass wrote:

>On February 02, 2004 at 06:51:46, Vasik Rajlich wrote:
>>Congratulations on the victory.
>>Also some food for thought in the selective search vs brute force search debate
>>- maybe with great hardware and a longer time control, a fast brute force search
>>re-enters the picture as a promising option.
>congratulation also for the victory but it has nothing to do with selective vs
>brute force search and I do not see it as a food for thought.
>It is obvious for me that programs search too many illogical moves and brute
>force will always lose against correct selective search with the same hardware
>if you are not close to solving the game.
>If selective search of somebody is losing then it only proves that the specific
>selective search is bad and proves nothing about selective search vs brute force

You can just guess on the right move without any search.

If it was the wrong move it just proves you didn't guess right, it doesn't prove
it would be impossible to guess right.




This page took 0.09 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.