Extended breadth-first search algorithm in practice

DOI10.14794/ICAI.9.2014.1.59MaRDI QIDQ5369818zbMATH OpenOpenAlexFDO

Authors Tamás Kádek, János Pánovics

Publication date 19 October 2017

Published in Proceedings of the 9th International Conference on Applied Informatics, Volume 1 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14794/icai.9.2014.1.59

zbMATH Keywords

artificial intelligencebreadth-first searchextended modelstate-space representation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Theory and techniques for synthesizing efficient breadth-first search algorithms
• KBFS: K-Best-First Search
• Breadth-first heuristic search
• Extended beam search for non-exhaustive state space analysis
• Linear-space best-first search

Cited in

(5)

• Certification of breadth-first algorithms by extraction
• Fast breadth-first search in still less space
• Breadth-first numbering
• Theory and techniques for synthesizing efficient breadth-first search algorithms
• Extended beam search for non-exhaustive state space analysis

This page was built for publication: Extended breadth-first search algorithm in practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369818)