$5$ clues is the minimum to force a unique solution on a $5 \times 5$ board. This enables us to figure out where '4A' and '5A' go, and also '2B' and '2E'. It is easy to deduce that '2A' must go in the top right corner (all other rows and columns have either a '2' or an 'A'). The large numbers in bold are the starting numbers. How would the answers to the above questions change if we played on a different size of grid?Įdit: this is a board in which 5 determines a unique solution.
What is the minimum number of squares which must be filled in order to determine a unique solution? I have done it with 5, but might it be done with fewer?Īre there other solutions which cannot be generated through the transformations described above? If so, how many? I have several questions relating to colour sudokus: interchanging any two colours with each other, or interchanging any two numbers.One can then conduct various transformations of this solution: One simply cycles through the integers in one direction (first row is 12345, second row is 23451, third row is 34512 etc) and cycles through the colours in the opposite direction (first row is ABCDE, second row is EABCD, third row is DEABC). It is easy to create a solved colour-sudoku. there is one and only one of each integer-colour combination (eg one blue 3).each row and column contains one and only one of each colour (eg red, blue, yellow, green, black).each row and column contains one and only one of each integer 1-5.I have designed a new type of sudoku-like puzzle, done on a 5*5 grid, with the following rules:
0 kommentar(er)
