Talk:Heiner's solver
From Sokoban Wiki
(Difference between revisions)
(Comments for Heiner's solver) |
(Thanks for the hints) |
||
| Line 4: | Line 4: | ||
JSoko also uses a bipartite matching for calculating a pushes lower bound. You can see the calculated value when you mark the checkbox at: Settings->Show minimum solution length | JSoko also uses a bipartite matching for calculating a pushes lower bound. You can see the calculated value when you mark the checkbox at: Settings->Show minimum solution length | ||
Maybe this helps testing your coding. | Maybe this helps testing your coding. | ||
| + | |||
| + | :Thanks for the hints! I did already download JSoko, and have started to use it. I already enjoy "minimum solution length" <code>:-)</code>. | ||
| + | :Have just downloaded YASC... but I find it not so easy to read the sources... well, I'm not fluent in Delphi. I'll try studying other's sources occasionally for concrete details/topics. Maybe I should read JSoko with "eclipse"... might help a lot. | ||
| + | :--[[User:Heiner|Heiner]] 00:15, 3 December 2010 (UTC) | ||
Current revision as of 00:15, 3 December 2010
Thanks a lot for your description of your solver!
The programs YASC Sokoban and JSoko are open source. Maybe you want to take a look into the codings of those programs. You can also compare the deadlocks found by those programs with your program. JSoko also uses a bipartite matching for calculating a pushes lower bound. You can see the calculated value when you mark the checkbox at: Settings->Show minimum solution length Maybe this helps testing your coding.
- Thanks for the hints! I did already download JSoko, and have started to use it. I already enjoy "minimum solution length"
:-). - Have just downloaded YASC... but I find it not so easy to read the sources... well, I'm not fluent in Delphi. I'll try studying other's sources occasionally for concrete details/topics. Maybe I should read JSoko with "eclipse"... might help a lot.
- --Heiner 00:15, 3 December 2010 (UTC)
