Place 9 non-zero digits into the squares of a 3x3 chessboard so that any 2 consecutive digits share a common side of 2 neighboring squares.
In how many ways can this task be achieved?
(In reply to
solution and discussion by Charlie)
To me, "place 9 non-zero digits" means any 9 digits (including repeats). e.g. you could fill the chessboard with all 7s or something.
I'm guessing your interpretation of the problem is what the author intended, but curious if you could solve for the more literal reading of the problem where there are 9^9 possible grids, as opposed to 9! possible grids?
|
|
Posted by tomarken
on 2021-06-28 08:28:15 |
re: solution and discussion
