I have the following Skyscrapers puzzle:
C3 | C1 | C2 | C3 | C4 | C4 | C2 | ||
---|---|---|---|---|---|---|---|---|
C2 | V3 | C5 | ||||||
C4 | V1 | C1 | ||||||
C3 | C4 | |||||||
C2 | V5 | C3 | ||||||
C3 | V7 | C3 | ||||||
C3 | V4 | V2 | C2 | |||||
C1 | V2 | C2 | ||||||
C1 | C3 | C4 | C2 | C2 | C2 | C2 |
C -> Clues how many skyscrapers are visible V -> Skyscrapers numbers without prefix -> Nopes. Which means these Skyscrapers are not possible on the field.
Now I have a program which normally solves these boards by generating the permutations of the skyscrapers per row. Somehow it cannot solve the board completely.
I'm stuck on this step:
C3 | C1 | C2 | C3 | C4 | C4 | C2 | ||
---|---|---|---|---|---|---|---|---|
C2 | V5 | V7 | V6 | 2,3,5,6,7 | 3,5,6,7 | V3 | 3,4,5,6,7 | C5 |
C4 | 1,4,5,6,7 | V1 | 1,2,3,6,7 | V6 | 1,6,7 | 1,3,4,6,7 | V7 | C1 |
C3 | 4,5,6,7 | 1,6,7 | V7 | 2,5,6,7 | V6 | 1,3,6,7 | 5,6,7 | C4 |
C2 | V6 | 1,4,5,6,7 | 2,3,5,6,7 | V5 | V7 | 1,3,5,6,7 | 4,5,6,7 | C3 |
C3 | 4,5,6,7 | 1,3,4,6,7 | 2,6,7 | V7 | 5,6,7 | V6 | 5,6,7 | C3 |
C3 | V4 | V6 | 2,4,5,6,7 | V2 | 2,4,5,6,7 | V7 | V5 | C2 |
C1 | V7 | 1,2,6,7 | V2 | 1,2,5,6,7 | 1,2,6,7 | V1 | V6 | C2 |
C1 | C3 | C4 | C2 | C2 | C2 | C2 |
My question is: How can you get the next Skyscraper on the field?