Computer Chess Club Archives

Search

Messages

Subject: Re: A theoretical question

Author: Ulrich Tuerke

Date: 06:32:44 05/31/00

Go up one level in this thread

On May 31, 2000 at 09:00:46, Georg v. Zimmermann wrote:

>Lets assume you know beforehand what move your program will choose, in every
>position. This does not have to be the best move.
>
>You now extend on that move. Will that make your program stronger ?
>
>If yes, lets assume your program likes to move with its knights a lot. Will you
>make it stronger by extending on knight moves ?

I think that the opposite is true. Your program will extend uninteresting moves
on cost of the remaining moves. The reached search depth will suffer
correspondingly (assuming that you have some time limit for the search).

I'm not sure if i got you right ?

Regards, Uli

• Re: A theoretical question Georg v. Zimmermann 07:47:40 05/31/00
  • Re: A theoretical question Ulrich Tuerke 07:59:45 05/31/00
    • Re: A theoretical question Marc van Hal 14:29:41 05/31/00
      • Re: A theoretical question Laurence Chen 15:47:30 05/31/00
        • Re: A theoretical question Robert Hyatt 09:12:02 06/01/00
          • Cats vs Dogs, Knights vs Bishops, the verdict Laurence Chen 02:41:58 06/02/00
            • Re: Cats vs Dogs, Knights vs Bishops, the verdict Robert Hyatt 07:48:52 06/02/00

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.