Computer Chess Club Archives

Search

Messages

Subject: Re: Question for Chess Programmers

Author: Sylvain Lacombe

Date: 22:14:12 12/21/98

Go up one level in this thread

>I agree; there are usually a lot of forced mates in a given position, and the
>first one found is usually NOT the fastest.
>
>James

Well, if iterative deepening is implemented, it will find the fastest mate. If a
mate his found at deep 4, their his no reason to continue the search cause there
is nothing better than mate. But you need a condition for it to stop.

The only thing i can think of for not implementing the PV play is the extra code
it takes.

Sylvain.

• Re: Question for Chess Programmers Dezhi Zhao 04:14:27 12/22/98
  • Re: Question for Chess Programmers Robert Hyatt 12:17:58 12/23/98
  • Re: Question for Chess Programmers Sylvain Lacombe 07:39:09 12/22/98
    • Re: Question for Chess Programmers Dave Gomboc 17:14:02 12/22/98
• Re: Question for Chess Programmers Peter McKenzie 22:31:30 12/21/98
  • Re: Question for Chess Programmers Sylvain Lacombe 00:04:52 12/22/98
    • Re: Question for Chess Programmers Roberto Waldteufel 09:54:50 12/22/98
      • Re: Question for Chess Programmers Sylvain Lacombe 10:26:10 12/22/98
        • Re: Question for Chess Programmers Roberto Waldteufel 19:19:24 12/22/98

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.