SoCS 2012
Automatic Move Pruning Revisited
Abstract
In this paper we show that the move pruning method we presented at SoCS last year sometimes prunes all the least-cost paths from one state to another. We present two examples exhibiting this erroneous behaviour--a simple, artificial example and a slightly more complex example that arose in last year
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- International Symposium on Combinatorial Search
- Archive span
- 2010-2024
- Indexed papers
- 598
- Paper id
- 505799352361842315