Enhanced Linear Programming Approaches to Sudoku

Shou-yu TONG, Fu-zhong CONG, Zhi-xia WANG

Abstract


As an NP-hard problem, solving Sudoku becomes extremely hard when its size gets large. Traditionally, people used a linear programming method, which can solve most Sudoku puzzles quickly but sometimes may fail to find the correct solutions. We introduced several enhanced linear programming methods to improve the rate of success.

Keywords


Sudoku, Linear programming, Sparsity.


DOI
10.12783/dtetr/icamm2016/7333

Refbacks

  • There are currently no refbacks.