Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
0 of .
Results for:
No results containing your search query
P. 1
Df-pn: Depth-first Proof Number Search

Df-pn: Depth-first Proof Number Search

Ratings: (0)|Views: 810 |Likes:
Published by Chris Nash

More info:

Categories:Types, School Work
Published by: Chris Nash on Jul 04, 2008
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as ODP, PDF, TXT or read online from Scribd
See more
See less





Df-pn: Depth-first Proof Number Search
Studied by Ayumu NagaiSurveryed by Akihiro Kishimoto
Outline of Presentation
MotivationsProof Number SearchSeos AlgorithmDf-pnConclusions
Why do we use depth-first search?
 – Dfs uses less memory than bfs in general
O(d) v.s. O(b^d)
 – Has low overhead to manage nodes
C.f. A* needs priority queue, IDA* just needs stack 
 –Can behave like bfs with TT
C.f. IDA* and A*, SSS* and MT-SSS*,Seo and AO*

Activity (7)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
bothernolonger liked this
beoanhcuaanh liked this
mrorc liked this
dawadax liked this
shivabear liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->