Group Abstract Group Abstract

Message Boards Message Boards

puzzle n^2 -1

GROUPS:
Hello, after reading several documents related to the puzzle n ^ 2-1, I have wondered if it is possible to implement in Mathematica, for I have found for other languages ​​but nothing to Mathematica, I hope someone of you can give me an idea, thanks.

The problem is this

POSTED BY: luis ledesma
Answer
1 year ago
I hope any idea about it, something to guide me
POSTED BY: luis ledesma
Answer
1 year ago
This demonstration project is like the game you mention:
http://demonstrations.wolfram.com/PicturePuzzle

A really typical way of solving a problem like this is to write a function that recursively searches for a solution. While you probably can't find an example for your particular problem, you can find it for other problems. I would encourage you to look online for sudoku solvers written in Mathematica and other similar languages. Most sudoku solvers work by recursively searching for a solution. Once you understand how the sudoku solver works, you should be able to apply the same technique to write a solver for your problem.
POSTED BY: Sean Clarke
Answer
1 year ago
thanks Sean Clarke,it is also very true what you mention, I will begin to review what recursion.
POSTED BY: luis ledesma
Answer
1 year ago
This puzzle is a 15 puzzle. There is a  reference  in  Math world. 
http://mathworld.wolfram.com/15Puzzle.html
POSTED BY: Yoshihiro Sato
Answer
1 year ago