Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
2020 International Conference on INnovations in Intelligent SysTems and Applications (INISTA), 2020, p.1-7
Ort / Verlag
IEEE
Erscheinungsjahr
2020
Quelle
IEEE Electronic Library (IEL)
Beschreibungen/Notizen
Blocks World is a prototype artificial intelligence problem used to exemplify problem solving using searching and planning algorithms. In this paper we present and experimentally evaluate combinatorial algorithms for measuring the size of the search graph associated to this problem. We focus on evaluating exactly a few metrics on the Blocks World state space graph, including the number of states, the average number of stacks per state, the number of transitions, and the average branching factor.