Talk:Solve a Hidato puzzle: Difference between revisions

Content added Content deleted

Inline

Revision as of 01:31, 3 May 2012 (view source) rosettacode>Bearophile (→‎Any good general algorithm?) ← Older edit		Revision as of 06:39, 3 May 2012 (view source) rosettacode>Bearophile (→‎Any good general algorithm?) Newer edit →
Line 76:		Line 76:

	: The second "sturdy" D version is able to solve the stress (but it's a little slower than the C version because it uses higher level data structures and no pointers, I'll try to speed it up a bit). I think the first "light" D entry breaks on the stress test, so it should be improved by someone.		: The second "sturdy" D version is able to solve the stress (but it's a little slower than the C version because it uses higher level data structures and no pointers, I'll try to speed it up a bit). I think the first "light" D entry breaks on the stress test, so it should be improved by someone.

			:: The first simple D version now seems to work correctly.