Problem 44376. The sliding puzzle: 3D
Solution Stats
Problem Comments
-
9 Comments
there is a bug in the evaluation function, I believe "abs(a1 + b1 + c1 - a0 - b0 - c0) == 1" should be changed to "abs(a1-a0) + abs(b1-b0) + abs(c1-c0) == 1". In any way, this was a very cool problem, unless I am misremembering this would be the very first one that forced me to implement some version of A* in Cody :)
Alfonso, it is an honor and a pleasure to have read your comment. I'm glad you enjoyed the problem. Thank you for spotting the bug. I will update accordingly.
Alfonso, I've fixed the bug. As a result, I've actually located a tiny typo, one single character in my own solution that was, in fact, the difference between a correct and an incorrect solution based on your correction. Fixed that too, of course. Thanks again!
It takes 9 seconds to solve the four inputs on my laptop, but the system rejected my code with the error of long run time. What's the acceptable time for the four inputs?
This one kept my busy, and I think my solution is a bit of a tour de force. It is recipe based, rather than optimal, but there are just too many corner cases to program around. I should have made better use of invariant sets, I guess.
Difficult problem
Good problem. Tip: use the L1-norm or manhattan distance using the 3 indexes as a cost function.
I am actually giving up :(
tried a lot......
Too difficult
Solution Comments
Show commentsProblem Recent Solvers49
Suggested Problems
-
295 Solvers
-
341 Solvers
-
Duplicate each element of a vector.
606 Solvers
-
Create a Multiplication table matrix...
509 Solvers
-
Is this is a Tic Tac Toe X Win?
512 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!