hw4 - CSCI-561 Fall 2010 Homework 4 Student name: _...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSCI-561 Fall 2010 Macskassy Homework 4 Due Nov. 17, 2010 Student name: _____________________________ Student ID: _________________ Question 1 [30 points] Sudoku problem can be as general with size n 2 x n 2 . The rules are: (1) Each row contains unique number from 1 to n 2 . (2) Each column contains unique number from 1 to n 2. (3) Each n x n box contains unique number from 1 to n 2 . Consider n = 2, below shows a 4 x 4 problem instance (left) and solution (right), Convert this problem into a SAT problem. Consider the WalkSAT algorithm in the text book, a. [15 points] Can you suggest an alternate flipping strategy to that described in the book to get WalkSat to converge to a result faster? b . [15 points] Implement your strategy and compare your strategy with the one in the book. Explain why your data exhibit a better convergence time and how it is related to the Sudoku problem. (Your result should average at least 100 runs of at least 5 puzzles and set maxflip as high as it resolves the puzzle.) The names of input and output file are input_x.txt and output_x.txt respectively, where x
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/24/2011 for the course CS 561 at USC.

Page1 / 3

hw4 - CSCI-561 Fall 2010 Homework 4 Student name: _...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online