Sciweavers

    106
    Voted
    AAAI
    2010
    219views Intelligent Agents» more  AAAI 2010»
    Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
    15 years 4 months ago
    Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
    Download  www.is.titech.ac.jp
    Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
    Akihiro Kishimoto
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.