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
re: solution and discussion by tomarken)
That interpretation leads to some other problems of interpretation. If there are several 1's and several 2's would each 1 have to be adjacent to a 2 and vice versa, or just one occurrence of 1-2.
But also if the presence of a 1 implies the presence of a 2 and the presence of a 2 implies the presence of a 3, then we're back to the original interpretation. I guess for example that when examining each cell, say it's a 4, check to see if any 3's or 5's are present; if either is present then at least one of each that is present must be adjacent to the 4.
It also questions what are the routes mentioned in the title.
|
|
Posted by Charlie
on 2021-06-28 09:46:08 |
re(2): solution and discussion
