Modeling the 8-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets
We begin with some basic definitions and concepts from convex analysis and projection onto convex sets (POCS). We next introduce various algorithms for converging to the intersection of convex sets and review various results (Elser’s Difference Map is equivalent to the Douglas-Rachford and Fienup’s...
Main Author: | Schaad, Jason |
---|---|
Language: | English |
Published: |
University of British Columbia
2010
|
Online Access: | http://hdl.handle.net/2429/28469 |
Similar Items
-
Modeling the 8-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets
by: Schaad, Jason
Published: (2010) -
Modeling the 8-queens problem and Sudoku using an algorithm based on projections onto nonconvex sets
by: Schaad, Jason
Published: (2010) -
Scaling of popular Sudoku solving algorithms
by: Videl, Markus, et al.
Published: (2014) -
Efficient array for solving sudoku problem
by: Foroutan Rad, Aria
Published: (2018) -
Sudoku Solvers
by: Johansson, Simon Johansson, et al.
Published: (2013)