problemset8

# problemset8 - Introduction to Computers and Engineering...

This preview shows pages 1–3. Sign up to view the full content.

Introduction to Computers and Engineering Problem Solving 1.00 / 1.001 Fall 2005 Problem Set 8 Due: 11AM, Tuesday November 22, 2005 (We will not accept late submissions) Soduko: Part 1 [100 points] Introduction In Problem Sets 8 and 9, you are going to implement the Soduko game. You will need to develop the GUI for the game as well as the strategy to play. The Soduko game board consists of a grid of 9x9 cells. The grid is divided into 9 sub- grids, each having 3x3 cells. The goal of the game is to populate the 81 cells with the numbers 1-9 according to the following rules: - each 9 cell row must have exactly 1 of each of the 9 numbers in it - each 9 cell column must have exactly 1 of each of the 9 numbers in it - each 9 cell sub-grid must have exactly 1 of each of the 9 numbers in it For example, the following configuration is legal: And the following configuration is illegal: 1.00/1.001 1/4 Fall 2005

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is illegal for three reasons: there is more than one 9 in the second row, more than one 9 in the second column, and more than one 9 in the top left sub-grid. Any of these violations would make the solution invalid. To get familiar with the game, you can play it at: http://www.mousebreaker.com/games/sudoku/play.php Your goal in this problem set is to design the application described above, based on the system requirements stated below. You will implement the design that you create here in Problem Set 9. NOTE:
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/29/2011 for the course CIVIL 1.00 taught by Professor Georgekocur during the Spring '05 term at MIT.

### Page1 / 4

problemset8 - Introduction to Computers and Engineering...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online