Computer Chess Club Archives

Search

Messages

Subject: How to manage search depth in limited time?

Author: Pham Minh Tri

Date: 21:23:21 03/15/01

Hi,

Suppose the time for searching a move is limited in T minus. And a program has
just finished the iterative loop of depth N. My question: How to decide that the
time left is enough for the next loop (depth N+1) or not?

(Some books suggested me to continue searching next depth and interrupt when
time is over. But I don't like this method because of wasting time.)

Any suggestions would be very appreciated.
Pham

• Re: How to manage search depth in limited time? Robert Hyatt 05:51:52 03/16/01
  • Re: How to manage search depth in limited time? Miguel A. Ballicora 08:04:01 03/16/01
    • Re: How to manage search depth in limited time? Robert Hyatt 12:16:57 03/16/01
    • Re: How to manage search depth in limited time? Severi Salminen 11:17:07 03/16/01
      • Re: How to manage search depth in limited time? Uri Blass 00:31:05 03/17/01
• Re: How to manage search depth in limited time? Matt McKnight 02:12:49 03/16/01
  • Re: How to manage search depth in limited time? Robert Hyatt 05:53:26 03/16/01
  • Re: How to manage search depth in limited time? Uri Blass 02:49:25 03/16/01
    • Re: How to manage search depth in limited time? Robert Hyatt 05:54:35 03/16/01
• Re: How to manage search depth in limited time? David Rasmussen 23:29:59 03/15/01
  • How about Half way Search ? Re: How to manage.. Eelco de Groot 03:39:28 03/16/01
    • Re: How about Half way Search ? Re: How to manage.. Robert Hyatt 05:58:02 03/16/01
  • Re: How to manage search depth in limited time? Uri Blass 23:48:19 03/15/01
    • Re: How to manage search depth in limited time? David Rasmussen 05:09:18 03/16/01

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