Tweet
Originally posted by Urban Ranger
Sudoku does't look anything like that at all.
Sudoku does't look anything like that at all.
what?
Good God, Urban Ranger. Suduko solving is a textbook example of graph coloring.
Stop correcting people when you've no idea of what you speak of.
Solving a sudoku puzzle is equivalent to properly "coloring" a particular graph—an array of points (vertices) and lines (edges). In this case, the graph has 81 vertices, one for each cell of the grid. Depending on the puzzle, only certain pairs of vertices are joined by an edge. Given that some vertices have already been assigned a "color" (chosen from nine possibilities), the problem is to "color" the remaining vertices so that any two vertices joined by an edge don't have the same "color."
Nonetheless, there are strategies that computer programmers can use to generate puzzles and find solutions relatively quickly for nine-by-nine grids—and even larger ones.
Nonetheless, there are strategies that computer programmers can use to generate puzzles and find solutions relatively quickly for nine-by-nine grids—and even larger ones.
Comment