There is a possibility to describe an algorithm for the procedural generation of the map puzzle?

Warning: count(): Parameter must be an array or an object that implements Countable in /home/styllloz/public_html/qa-theme/donut-theme/qa-donut-layer.php on line 274
0 like 0 dislike
Hello! There are golovaci type: "move boxes to get up on the buttons." There is a two-dimensional map with n-number of boxes and the same number of buttons. For example, the game "Smart loader", and in General met a number of implementations. People come up with this method: "what if," and trying to figure this out? There are vozmost to create an algorithm for automatic map puzzle rastanovka buttons and assimov? Of course with 100% reshimosti. Anyone have any ideas on this score have? Thank you in advance for your help.
by | 102 views

1 Answer

0 like 0 dislike
In a pinch you can always generate a already solved the map and moving it the boxes for all the rules of the game in reverse order. Just for the fun levels will have some additional rules for these moves to pick up, that would be more difficult options, and not shift fro one box.

And, you can pour a Rand and check reshimosti. Then a little fix.
110,608 questions
257,187 answers
40,253 users