About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 114. Chapters: 9814072356 (number), Age of the captain, Almost integer, Ant on a rubber rope, Autobiographical number, Bedlam cube, Boris Kordemsky, Bulgarian solitaire, Carpenter's rule problem, Change-making problem, Coin problem, Conway puzzle, Cross-figure, Domino tiling, Ed Pegg, Jr., Egyptian fraction, Eight queens puzzle, Eleusis (card game), Equal incircles theorem, Flexagon, FRACTRAN, Go and mathematics, Grundy's game, Happy number, Harary's generalized tic-tac-toe, Hexagonal tortoise problem, Home prime, Homicidal chauffeur problem, Hundred-dollar, Hundred-digit Challenge problems, Huzita-Hatori axioms, Jeep problem, Journal of Recreational Mathematics, Kawasaki's theorem, Kobon triangle problem, Leigh Mercer, List of recreational number theory topics, Longest uncrossed knight's path, Magic hyperbeam, Magic hypercube, Magic square, Maris-McGwire-Sosa pair, Martin Gardner, Masahiko Fujiwara, Mathematical coincidence, Mathematical puzzle, Mathematics and fiber arts, Mathematics of paper folding, Mathematics of Sudoku, Mice problem, Mobius strip, Moser's worm problem, Mountain climbing problem, Moving sofa problem, Napkin folding problem, Napkin ring problem, Narcissistic number, Nasik magic hypercube, Necklace problem, Nim, Patterns in nature, Perfect digit-to-digit invariant, Polite number, Polyhedron model, Polyking, Polyknight, Polyomino, Popular mathematics, Postage stamp problem, Prime reciprocal magic square, Proizvolov's identity, Rigid origami, Rithmomachy, Sangaku, Slothouber-Graatsma puzzle, Soma cube, Squaring the square, Str8ts, Subtract a square, Sylver coinage, Tangram, The Man Who Counted, Thomas von Randow, Vi Hart, Wine/water mixing problem. Excerpt: The class of Sudoku puzzles consists of a partially completed row-column grid of cells partitioned into N regions each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers ), so that each row, column and region contains exactly one of each element of the set. The puzzle can be investigated using mathematics. The mathematical analysis of Sudoku falls into two main areas: analyzing the properties of a) completed grids and b) puzzles. Grid analysis has largely focused on counting (enumerating) possible solutions for different variants. Puzzle analysis centers on the initial given values. The techniques used in either are largely the same: combinatorics and permutation group theory, augmented by the application of programming tools. There are many Sudoku variants, (partially) characterized by the size (N) and shape of their regions. For classic Sudoku, N=9 and the regions are 3x3 squares (called blocks or boxes). A rectangular Sudoku uses rectangular regions of row-column dimension RxC. For Rx1 (and 1xC), i.e. where the region is a row or column, Sudoku becomes a Latin square. Other Sudoku variants also exist, such as those with irregularly-shaped regions or with additional constraints (hypercube) or different (Samunamupure) constraint types. See Sudoku - Variants for a discussion of variants and Sudoku terms and jargon for an expanded listing. The mathematics of Sudoku is a relatively new area of exploration, mirroring the popularity of Sudoku itself. NP-completeness was documented late 2002, enumeration results began appearing in May 2005. In contrast with the two main mathematical approaches of Sudoku mentioned above, an approach resting on mathematical logic and dealing with the resolution of the puzzles from the viewpoint of a player has recently been proposed in Denis Berthier's book "The Hidden Logic of Sudoku." This formalizes certain mathematical symmetries of the game and elicits resolution rules based on them, s"
