Solving Sokoban Optimally with Domain-Dependent Move Pruning

BRACIS, pp. 264-269, 2015.

Cited by: 0|Views17


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 s...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :