A Warm Restart Strategy for Solving Sudoku by Sparse Optimization Methods

Author name not available (Why is that?)

Publication date: 17 July 2015

Abstract: This paper is concerned with the popular Sudoku problem. We proposed a warm restart strategy for solving Sudoku puzzles, based on the sparse optimization technique. Furthermore, we defined a new difficulty level for Sudoku puzzles. The efficiency of the proposed method is tested using a dataset of Sudoku puzzles, and the numerical results show that the accurate recovery rate can be enhanced from 84%+ to 99%+ using the L1 sparse optimization method.

Has companion code repository: https://github.com/haleyhfeng/Sudoku-Challenge

Mathematics Subject Classification ID

No records found.

This page was built for publication: A Warm Restart Strategy for Solving Sudoku by Sparse Optimization Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6263813)