Computer Chess Club Archives

Search

Messages

Subject: Search algorithms in chess programs

Author: Russell Reagan

Date: 20:27:58 12/12/01

Depth-first search is usually what is used in chess programs (at least all that
I have seen source for). What are the drawbacks of other search algorithms such
as breadth-first and best-first that prevent them from being more widely used in
chess programs?

• Re: Search algorithms in chess programs Gian-Carlo Pascutto 06:26:37 12/13/01
• Re: Search algorithms in chess programs David Rasmussen 00:56:52 12/13/01
• Re: Search algorithms in chess programs Wylie Garvin 00:33:07 12/13/01
  • Re: Search algorithms in chess programs James Swafford 06:20:17 12/13/01
  • Re: Search algorithms in chess programs Uri Blass 00:47:39 12/13/01
    • Re: Search algorithms in chess programs José Carlos 06:17:23 12/13/01
      • Re: Search algorithms in chess programs Uri Blass 07:13:32 12/13/01
        • Re: Search algorithms in chess programs Christophe Theron 09:35:35 12/13/01
    • Re: Search algorithms in chess programs Wylie Garvin 01:14:23 12/13/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.