User talk:Heiner
From Sokoban Wiki
| Line 35: | Line 35: | ||
or do you have a solver which guarantees push optimality? | or do you have a solver which guarantees push optimality? | ||
--[[User:Heiner|Heiner]] 04:13, 21 November 2010 (UTC) | --[[User:Heiner|Heiner]] 04:13, 21 November 2010 (UTC) | ||
| + | |||
| + | <div style="background-color:#F0FFF0;padding:5px;border:1px solid green;"> | ||
| + | I compared the results with those at sokobano.de. <br> | ||
| + | However, I could have also used [http://www.sokoban-online.de JSoko] which includes a solver which guarantees push optimality.<br> | ||
| + | --[[User:Matthias Meger|Matthias]] 12:26, 21 November 2010 (UTC) | ||
| + | </div> | ||
Revision as of 11:31, 21 November 2010
Hello Heiner.
The wiki contains some levels for testing the solver. You can compare your results with the one in the wiki. Maybe you can publish some of your results in the future.
- MatthiasThanks for the hint. I will publish some of my results, most probably on my user page, first, as e.g. I do not yet compute the moves, only the pushes. There is still much to do, the program is very experimental.
BTW: On the JSoko statistics pages like SolverStatistics-jsoko-DavidWSkinner-Microban,
shouldn't the unit of time be stated? I guess its milli seconds...
-- Heiner 23:02, 15 November 2010 (UTC)
Coding a solver is very time consuming. Maybe comparing your results with other solvers will help you to find out whether you are on a good way. At least in my solver I often have implemented new ideas and then recognized that the new ideas weren't that useful in most of the levels.
You are right. The time unit is missing. However, I just copied the output of the program into the wiki. The time is not important. The solver have "unlimited" time for solving levels in the comparisons.
- Matthias
Ok, yes, time is not that important. It can give an impression about how hard the job is for the solver. I'm just curious ;-)
Regarding new ideas... I suspect I will implement them anyhow. While I like to be competetive, for me the major source of fun is the programming itself. E.g. I did never before work with bipartite matchings, so I will do that.
Thanks for the results. I checked them - they are indeed all push optimal.
- Matthias
Thanks for checking... How did you do that? Did you compare with the best known solution, or do you have a solver which guarantees push optimality? --Heiner 04:13, 21 November 2010 (UTC)
