Timeline for Creating a Simple Puzzle resolution Algorithm
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 30, 2017 at 12:44 | comment | added | DMGregory♦ | Minor quibble: the solution presented isn't really "backtracking" in the algorithmic sense described by the link. A backtracking algorithm tries to solve a problem incrementally but naively, making occasional missteps that it doesn't detect until some time later, when it realises it's in a dead end and abandons that trial solution, "backtracking" or undoing steps back to an earlier choice and trying a different decision. The algorithm described here always proceeds with placing and never second-guesses its work — in fact it works equally well proceeding forward from the start to the goal. | |
| Mar 30, 2017 at 11:24 | history | edited | Philipp | CC BY-SA 3.0 |
added 26 characters in body
|
| Mar 30, 2017 at 11:22 | vote | accept | Hadrien | ||
| Mar 30, 2017 at 11:22 | comment | added | Hadrien | Really nice explanation and approach, I'm currently developing a basic generator to try this. Thank you! | |
| Mar 30, 2017 at 11:18 | history | edited | Philipp | CC BY-SA 3.0 |
added 242 characters in body
|
| Mar 30, 2017 at 11:13 | history | answered | Philipp | CC BY-SA 3.0 |