The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Move pruning increases the efficiency of heuristic search techniques by not expanding parts of the state space. In this article, we propose an admissible domain-dependent move pruning (DDMP) technique for Sokoban. When exploring a node DDMP analyzes and selects a subset of successor nodes required to be generated to preserve all optimal solutions. DDMP has low space and time overhead. It reduces the...
A pattern database (PDB) stores shortest distances from abstract states to a set of abstract goal states. For many search problems the best heuristic function is obtained using PDBs. We aim to find optimal solutions for Sokoban using PDBs. Due to the domain-specific characteristics of the goal states a straightforward application of PDBs in Sokoban results in an ineffective heuristic function. We...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.