# Non-Diagonal Pointing Problem

You can see the rules for pointing problem at this article. It has been clarified that there is no solution to this question.

But, what if we remove the diagonal rule? is there any solution?

. 1 . | . . . | . . .
. . . | . 2 . | . . .
. . . | . . . | . 7 .
------+-------+------
. . . | . . . | 9 . .
. . . | 3 . . | . . .
4 . . | . . . | . . .
------+-------+------
. . . | . . . | . . 6
. . . | . . 8 | . . .
. . 5 | . . . | . . .


I got 720 solutions having the 1 in the top left bloc.

• And that are all solutions, since the whole trail of numbers is circular, you can assign the name "1" to any Number and edit the rest accordingly. So in the End there are 720 times 9 solutions (just shifting through the numbers) – Falco Sep 25 '14 at 15:09
• Exactly. That's why I added this restriction. – Florian F Sep 25 '14 at 15:24