2000 character limit reached
Sudoku as a special transportation problem (1210.2584v1)
Published 9 Oct 2012 in cs.DS
Abstract: Sudoku is a popular combinatorial puzzle. A new method of solving Sudoku is presented, which involves formulating a puzzle as a special type of transportation problem. This model allows one to solve puzzles with more than one solution, keeping the constraints of the problem fixed, and simply changing a cost matrix between solutions.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.