Read without ads and support Scribd by becoming a Scribd Premium Reader.
 
Df-pn: Depth-first Proof Number Search
Studied by Ayumu NagaiSurveryed by Akihiro Kishimoto
 
Outline of Presentation
MotivationsProof Number SearchSeos AlgorithmDf-pnConclusions
 
Motivations
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*
Search History:
Searching...
Result 00 of 00
00 results for result for
  • p.
  • More From This User

    Notes
    Load more