Sudoku programming with C. (2015)
- Record Type:
- Book
- Title:
- Sudoku programming with C. (2015)
- Main Title:
- Sudoku programming with C
- Further Information:
- Note: Giulio Zambon.
- Authors:
- Zambon, Giulio
- Contents:
- At a Glance; Contents; About the Author; Introduction; Chapter 1: Modeling a Sudoku Puzzle in C; Solving a Puzzle; Generating a Puzzle; Modeling the Puzzle; Summary; Chapter 2: The Strategies; Level 0 Strategies; The Strategy Naked Single; The Strategy Unique; The Strategy Cleanup; Usage of Level 0 Strategies; Level 1 Strategies; The Strategy Naked Pair; The Strategy Hidden Pair; The Strategy Box-Line; The Strategy Pointing Line; Level 2 Strategies; The Strategies Naked Triple and Naked Quad; The Strategy Hidden Triple; The Strategy Lines-2; The Strategy Y-wing; Level 3 Strategies. The Strategy X Y-ChainThe Strategy Rectangle; The Strategies Lines-3 and Lines-4; Level 4 Strategies; What about Coloring?; Strategy Selection; Summary; Chapter 3: The Solver Program; init(); cleanup(); solve(); Counting; Checking Consistency; Input/Output; Summary; Chapter 4: Implementing "Unique"; unique_unit(); unique(); unique_loop(); Summary; Chapter 5: Implementing "Naked" Strategies; naked_pair_unit(); naked_triple_unit(); naked_quad_unit(); Summary; Chapter 6: Implementing "Hidden" Strategies; hidden_pair_unit(); hidden_triple_unit(); Summary. Chapter 7: Implementing "Box-Line"box_line(); box_line_unit(); Summary; Chapter 8: Implementing "Pointing Line"; pointing_line(); pointing_line_box(); Summary; Chapter 9: Implementing "Lines" Strategies; lines_2(); lines_3(); lines_4(); lines(); An Example; Summary; Chapter 10: Implementing "Y-wing"; pairs_find(); y_wing_digit(); intersection();At a Glance; Contents; About the Author; Introduction; Chapter 1: Modeling a Sudoku Puzzle in C; Solving a Puzzle; Generating a Puzzle; Modeling the Puzzle; Summary; Chapter 2: The Strategies; Level 0 Strategies; The Strategy Naked Single; The Strategy Unique; The Strategy Cleanup; Usage of Level 0 Strategies; Level 1 Strategies; The Strategy Naked Pair; The Strategy Hidden Pair; The Strategy Box-Line; The Strategy Pointing Line; Level 2 Strategies; The Strategies Naked Triple and Naked Quad; The Strategy Hidden Triple; The Strategy Lines-2; The Strategy Y-wing; Level 3 Strategies. The Strategy X Y-ChainThe Strategy Rectangle; The Strategies Lines-3 and Lines-4; Level 4 Strategies; What about Coloring?; Strategy Selection; Summary; Chapter 3: The Solver Program; init(); cleanup(); solve(); Counting; Checking Consistency; Input/Output; Summary; Chapter 4: Implementing "Unique"; unique_unit(); unique(); unique_loop(); Summary; Chapter 5: Implementing "Naked" Strategies; naked_pair_unit(); naked_triple_unit(); naked_quad_unit(); Summary; Chapter 6: Implementing "Hidden" Strategies; hidden_pair_unit(); hidden_triple_unit(); Summary. Chapter 7: Implementing "Box-Line"box_line(); box_line_unit(); Summary; Chapter 8: Implementing "Pointing Line"; pointing_line(); pointing_line_box(); Summary; Chapter 9: Implementing "Lines" Strategies; lines_2(); lines_3(); lines_4(); lines(); An Example; Summary; Chapter 10: Implementing "Y-wing"; pairs_find(); y_wing_digit(); intersection(); footprint(); An Example; Summary; Chapter 11: Implementing "XY-chain"; xy_chain_digit(); xy_chain_step(); An Example; Summary; Chapter 12: Implementing "Rectangle"; rectangle(); rectangle_pattern(); rectangle_cell(); rectangle_step(). Case A: n == 0 and kBeq 0 and kBeq 0 and kBeq == 3; An Example; rectangle_step(): for 6, kBeq 0, chain: (1, 5); rectangle_step(): for 6, kBeq 1, chain (1, 5) (0, 6); rectangle_step(): for 6, kBeq 2, chain (1, 5) (0, 6) (7, 7); rectangle_step(): for 6, kBeq 3, chain (1, 5) (0, 6) (7, 7) (6, 5); rectangle_step(): for 6, kBeq 1, chain (1, 5) (0, 7); rectangle_step(): for 6, kBeq 2, chain (1, 5) (0, 7) (6, 6); rectangle_step(): for 6, kBeq 3, chain (1, 5) (0, 7) (6, 6) (7, 4); rectangle_step(): for 9; Pointing-line within rectangle; Summary. Chapter 13: Implementing "Backtrack"display_strats_in_clear(); Optimization; An Example; Summary; Chapter 14: Solving Thousands of Puzzles; The Example of Minimum Sudokus; Summary; Chapter 15: Generating Sudokus; Generating a Solved Sudoku; init() for the Generator; fill(); fill_digit(); Removing Clues to Make a Puzzle; brute_comp(); inconsistent_unit() for the Generator; Check for Uniqueness of the Solution; Completing the Generator; Utilities for the Generator; Summary; Chapter 16: Puzzle Statistics and More Puzzles; Statistic on Number of Clues; Statistic on Numbers. … (more)
- Publisher Details:
- Place of publication not identified : Apress
- Publication Date:
- 2015
- Copyright Date:
- 2015
- Extent:
- 1 online resource, illustrations (some color)
- Subjects:
- 005.133
Computer science
C (Computer program language)
Sudoku
COMPUTERS -- Programming Languages -- C
C (Computer program language)
Sudoku
Sudoku
Programmierung
Computer Science
Programming Techniques
Programming Languages, Compilers, Interpreters
Computers -- Programming -- General
Computers -- Programming Languages -- General
Computer programming / software development
Programming & scripting languages: general
Computers -- Programming -- Games
Games development & programming
Electronic books - Languages:
- English
- ISBNs:
- 9781484209950
1484209958
1484209966
9781484209967 - Related ISBNs:
- 9781484209967
- Notes:
- Note: Online resource; title from PDF title page (EBSCO, viewed April 1, 2015).
- Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.359748
- Ingest File:
- 01_322.xml