z-logo
open-access-imgOpen Access
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Author(s) -
Akihiro Kishimoto
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7534
Subject(s) - combinatorics , solver , graph , mathematics , node (physics) , search tree , algorithm , computation , discrete mathematics , tree (set theory) , proof of concept , computer science , search algorithm , mathematical optimization , physics , quantum mechanics , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom