User talk:Puzl bustr

From Sokoban Wiki

Revision as of 19:21, 16 March 2010 (view source) Matthias Meger (Talk | contribs) (Created page with 'Hello. Thanks a lot for your detailed ideas!!! I will try to implement them in the next solver for my program 'JSoko'. Matthias Meger') ← Older edit		Current revision as of 10:01, 18 March 2010 (view source) Puzl bustr (Talk | contribs)
Line 5:		Line 5:
	Matthias Meger		Matthias Meger
		+
		+	* Great! I just noticed my description of the goal trap algorithm is incomplete. Goal traps would be a good addition to the deadlock section of the wiki. I should exclude PRZs of push-squares which aren't "reversible": the extra condition that you can push from the goal to the push-square. In example goal trap on wall, only the PRZs along the wall constitute the goal trap, not the PRZ of the push-square off the wall. And there needs to be a condition where the goal itself belongs to the trap (as in the example goal trap on wall). A corner goal would have an empty goal trap but not belong to it - needs to be excluded as not a deadlock if corner has no box on it, provided some box can push to corner. The reversible region digraph generalization, with the example goal trap on wall as a sink and the off-the wall squares as a source, makes this clearer.
		+
		+	I'm relieved someone "able-handed" is working on this! I'm hoping you'll discuss it with other programmers and between you figure out what is easily implementable - some of my ideas are pretty ambitious and might take months or years to implement properly, if at all.
		+
		+	David Holland

---

Current revision as of 10:01, 18 March 2010

Hello.

Thanks a lot for your detailed ideas!!! I will try to implement them in the next solver for my program 'JSoko'.

Matthias Meger

• Great! I just noticed my description of the goal trap algorithm is incomplete. Goal traps would be a good addition to the deadlock section of the wiki. I should exclude PRZs of push-squares which aren't "reversible": the extra condition that you can push from the goal to the push-square. In example goal trap on wall, only the PRZs along the wall constitute the goal trap, not the PRZ of the push-square off the wall. And there needs to be a condition where the goal itself belongs to the trap (as in the example goal trap on wall). A corner goal would have an empty goal trap but not belong to it - needs to be excluded as not a deadlock if corner has no box on it, provided some box can push to corner. The reversible region digraph generalization, with the example goal trap on wall as a sink and the off-the wall squares as a source, makes this clearer.

I'm relieved someone "able-handed" is working on this! I'm hoping you'll discuss it with other programmers and between you figure out what is easily implementable - some of my ideas are pretty ambitious and might take months or years to implement properly, if at all.

David Holland