Difference between revisions of "Semi-Team"

From CDOT Wiki
Jump to: navigation, search
(Serial Sudoku Performance)
(Serial Sudoku Performance)
Line 23: Line 23:
  
 
Difficulty Medium:
 
Difficulty Medium:
02 00 00 |00 00 00 |00 00 00
 
09 00 00 |04 00 08 |00 00 06
 
00 03 08 |00 02 07 |00 00 00
 
____________________________
 
00 04 00 |00 00 03 |00 01 00
 
00 02 00 |00 04 00 |00 06 00
 
00 08 00 |05 00 00 |00 03 00
 
____________________________
 
00 00 00 |07 06 00 |03 05 00
 
07 00 00 |09 00 05 |00 00 08
 
00 00 00 |00 00 00 |00 00 01
 
 
Sudoku Solved - took - 6 millisecs
 
  
 
Difficulty Hard:
 
Difficulty Hard:
00 00 00 |08 00 02 |00 00 00
 
07 00 00 |00 00 00 |00 00 09
 
00 00 01 |00 00 09 |00 06 02
 
_____________________________
 
00 07 00 |06 00 00 |00 05 00
 
01 03 00 |00 00 00 |00 02 04
 
00 04 00 |00 00 07 |00 08 00
 
____________________________
 
08 01 00 |03 00 00 |05 00 00
 
05 00 00 |00 00 00 |00 00 08
 
00 00 00 |04 00 08 |00 00 00
 
Sudoku Solved - took - 16 millisecs
 
  
 
== Assignment 2 ==
 
== Assignment 2 ==
  
 
== Assignment 3 ==
 
== Assignment 3 ==

Revision as of 22:36, 1 April 2017


GPU610/DPS915 | Student List | Group and Project Index | Student Resources | Glossary

Semi-Team

Team Members

  1. Michael Fainshtein, Research, Development, Presentation

Email All

Progress

Assignment 1

Rules to play Sudoku

Sudoku is a logic puzzle where a grid composed of mini grids is presented to the player to fill each cell with a number unique to its column, row and mini-grid.

Sudoku Backtrack Algorithm

 Find row, col of an unassigned cell
 If there is none, return true
 For digits from 1 to 9
   a) If there is no conflict for digit at row,col
       assign digit to row,col and recursively try fill in rest of grid
   b) If recursion successful, return true
   c) Else, remove digit and try another
 If all digits have been tried and nothing worked, return false

Serial Sudoku Performance

Difficulty Medium:

Difficulty Hard:

Assignment 2

Assignment 3