Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Junior's long lines: more data about this....

Author: Don Dailey

Date: 10:34:53 12/26/97

Go up one level in this thread


On December 26, 1997 at 08:23:34, Fernando Villegas wrote:

>Well, tha's what I am saying. Behind deeper search, there is or must be
>a different approach. If an engine could select just one move per ply,
>then he could search maybe 500 plyes! The more you select, the more
>intelligent you must be to select without thrashing the esential. On the
>contrary, the full with searchers were not very intelligent because
>looking at all possible moves in his narrow lanscape guaranteed them not
>to lose something important. The cost was, of course, a very limited
>depth.
>A propos, joyeuse nouveau anné, Christophe.

If my program could select just 1 move per ply, I would only need to
do a 1 ply search!

-- 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.