4 ms·
It's beautiful! Looks like the optimal solution is 26 steps: https://github.com/polkerty/dog-bunny-puzzle-solver https://github.com/polkerty/dog-bunny-puzzle-so
by tibbar 4y ago
It's beautiful! Looks like the optimal solution is 26 steps: https://github.com/polkerty/dog-bunny-puzzle-solver https://github.com/polkerty/dog-bunny-puzzle-solver
- deleted 4y ago[deleted]
- wrbs 4y agoGot the same. There are 200 ways of doing this (if you don't distinguish between the 2 bunnies when they're on the same tile, 420 if you do). If you merge together moves involving the same animal there are only 4 (with length 15). https://gist.github.com/wrbs/5824e9b17c55b5ad3d8467f93e12ed8b https://gist.github.com/wrbs/5824e9b17c55b5ad3d8467f93e12ed8... (svg graph of the 4)
- aaron695 4y agoNice. I tried to fuzz this rather than use an exhaustive search. So random animals walk randomly. It gets stuck. So I added if no animal moves after 100 attempts, restart. But it seems to get stuck all the time. So it loops around mostly and eventually falls to the stuck position. I have to think about this, is the entropy such that you'll never practically escape by randomly walking? I feel like if I add more conditions it just becomes an exhaustive search with billions+ of times the extra calculations.
- ajkjk 4y agoI think if you refuse to duplicate states you'll get the solution pretty quickly.
- klabb3 4y ago> I tried to fuzz this rather than use an exhaustive search. Shame. Shame. Shame. rings bell
- tibbar 4y agoThis can be a useful approach when you have a very large number of states (as long as you also don't revisit states). In this case, there are few enough states to just BFS the fastest way directly.