Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Knowledge V Search Depth Illustrated With Diagrams

Author: Graham Laight

Date: 09:30:21 05/11/00

Go up one level in this thread


On May 11, 2000 at 12:10:14, Timothy J. Frohlick wrote:

>Graham,
>
>Very well illustrated.  You should write a book.  Maybe Bob Hyatt and Bruce
>Moreland could round out your author content.

Thanks very much!

I've often thought that a well chosen selection of CCC postings would make a
good book, myself.

>
>
>
>Is this possible:??
>
60 ** **************************************************************************
   ** **************************************************************************
    *   *       **         **       **       ** ****          ***    ********
    **        ***       ******        ****         ***   ***  ***       ***
40
    * *    *     *         **           ***            **        **     ***
     *           * **      **          **

20  ***          **     **            ***         ***                  ***
    ****

   *****           ********        ******    ***********            ******
10
  ****************************************************************************
  ****************************************************************************
  ****************************************************************************
0 ****************************************************************************
Ply       Moves......
>
>Wherein, the endsearches are made more accurate and only the "best" routes to
>the end are chosen.

It's a good idea, but unfortunately I'm not sure it would be possible, because
the number of possible positions increases exponentially as the game moves
forward.

-g

>Thank you,
>
>
>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.