Sudoku puzzles, and their variants, have become extremely popular in the last decade. They can now be found in major U.S. newspapers, puzzle books, and web sites; almost as pervasive are the many guides to Sudoku strategy and logic. We give a class of solution strategies-encompassing a dozen or so differently named solution rules found in these guides-that is at once simple, popular, and powerful. We then show the relationship of this class to the modeling of Sudoku puzzles as assignment problems and as unique nonnegative solutions to linear equations. The results provide excellent applications of principles commonly presented in introductory classes in finite mathematics and combinatorial optimization, and point as well to some interesting open research problems in the area.
- How nice! Actually, I thought it might be you when I heard your name, Raymond (@MathEdnet)! We should talk tomorrow :-) 1 month ago
- Enjoyed rehearsing rehearsals at #Novemberkonferansen with @ekazemi today! Choral counting has a lot to it! 4 months ago
- J. Skott: «Generic example of generic proofs is Gauss: 1+2+3...+100=?» #Novemberkonferansen #playonwords 4 months ago
- Next up at #Novemberkonferansen is Jeppe Skott, who talks about Goldilocks, mathematical reasoning and proof. Nice combination :-) 4 months ago
- Listening to a very nice lecture on the importance of maths by Chris Budd ( people.bath.ac.uk/mascjb/) at #Novemberkonferansen 4 months ago