I Will now work on the middle box

If the top two rows in the middle box are constant

- Code: Select all
`CCC`

CCC

---

Then the numbers which go into the bottom row are pre-decided

The only variable is the order in which they are placed

Each number can go in two boxes as one box will be blocked by that number in the square above and so that is the first variable

2

After that two numbers must be placed in two boxes.

Before that first number was placed each number had two possible locations and so one of the remaining numbers had the filled box as a possible location. This is now ruled out and so there are now no more variables

This means that if the top two rows are filled there are two ways of filling the bottom row.

- Code: Select all
`|CCC|`

|CCC|

|211|

I now need to find out the number of ways of competing the second row if the top row is constant

I believe that there are 9 ways of calculating the middle row but i can't remember why, i used both logic and trial and error to get this

I believe that there are 47 ways of making the top row of the middle box, agfain i used partially trial and error here.

I am not left with this permutations grid

- Code: Select all
`|CCC|CCC|321|`

|CCC|CCC|321|

|CCC|-47|121|

|CCC|-9-|121|

|CCC|211|121|

|333|111|111|

|222|222|111|

|111|111|111|

I now believe that if squares 1,2 an 4 are constant

- Code: Select all
`|CC-`

|C--|

|---|

then there are 2526142464 ways of finishing the grid