🚀 go-pugleaf

In article <13856@star.cs.vu.nl> erwvegm@cs.vu.nl (Erwin van Egmond) writes:
>Hi there,
>	I'm programming something which uses breadthfirst search.
>	Is there someone out there who knows about this implementation?

How about try DIFD search?
	0) let depth  = 1
	1) do depth first search once
	2) if no solution increment depth and goto 1)

It is easy to implement and stack size can be very small.
Of course it is slower than breadth-first search. But you will find
if breadth first pays, DIFD pays also.

I find it in the book called Search method in AI, but I can't remember exactly.
-- 
Shinji Kono @ Computing Laboratory, University Newcastle upon Tyne
kono@csl.sony.co.jp                     Room: 616 Claremont Bridge
from Sony Computer Science Laboratory, Inc, Japan.