Abstract (EN)

We present algorithms to compute and match maze specific deadlock tables at Sokoban. They enable to use a greedy search that can solve problems that are not solvable using IDA*.