Monster (“Mega”) Sudoku

Slides:



Advertisements
Similar presentations
Constraint Satisfaction Problems
Advertisements

CREATED BY: CALVIN WILLIAMS Bidirectional Search.
Constraint Satisfaction Problems (Chapter 6). What is search for? Assumptions: single agent, deterministic, fully observable, discrete environment Search.
Constraint Satisfaction Problems
Constraint Satisfaction taking advantage of internal structure of states when paths don’t matter.
This lecture topic (two lectures) Chapter 6.1 – 6.4, except
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
This lecture topic (two lectures) Chapter 6.1 – 6.4, except 6.3.3
ICS-271:Notes 5: 1 Lecture 5: Constraint Satisfaction Problems ICS 271 Fall 2008.
Artificial Intelligence Constraint satisfaction problems Fall 2008 professor: Luigi Ceccaroni.
CSP Yaron Kassner Winter Reminder Arc Consistency: the domains of pairs of variables are consistent. k-consistency: the domains of every k variables.
Constraint Satisfaction problems (CSP)
Methods of Proof Chapter 7, second half.. Proof methods Proof methods divide into (roughly) two kinds: Application of inference rules: Legitimate (sound)
Review: Constraint Satisfaction Problems How is a CSP defined? How do we solve CSPs?
Constraint Processing and Programming Introductory Exemple Javier Larrosa.
4 Feb 2004CS Constraint Satisfaction1 Constraint Satisfaction Problems Chapter 5 Section 1 – 3.
Artificial Intelligence Constraint satisfaction Chapter 5, AIMA.
Constraint Satisfaction Problems
CS460 Fall 2013 Lecture 4 Constraint Satisfaction Problems.
A game of logic where the player must assign the numbers 1..9 to cells on a 9x9 grid. The placement of the numbers must be such that every number must.
Midterm II Solution Prof. Mohamed Batouche Department of Computer Science CCIS – King Saud University Saudi Arabia.
Constraint Satisfaction Not all problems are solved by a sequential series of steps. How do we solve other types of problems?
Constraint Satisfaction Problems
SOLVING SUDOKU WITH MATLAB VERIFICATION FUNCTION correctness verification of the puzzle: checks if the current element appears twice in the same line,
Constraint Satisfaction Problems
Constraint Satisfaction Problems
ISC 4322/6300 – GAM 4322 Artificial Intelligence Lecture 4 Constraint Satisfaction Problems Instructor: Alireza Tavakkoli September 17, 2009 University.
Sudoku Solver Comparison A comparative analysis of algorithms for solving Sudoku.
Constraint Satisfaction CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
CSC 8520 Spring Paula Matuszek Based on Hwee Tou Ng, aima.eecs.berkeley.edu/slides-ppt, which are based on Russell, aima.eecs.berkeley.edu/slides-pdf.
Hande ÇAKIN IES 503 TERM PROJECT CONSTRAINT SATISFACTION PROBLEMS.
Chapter 5: Constraint Satisfaction ICS 171 Fall 2006.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Fall 2006 Jim Martin.
1 Chapter 5 Constraint Satisfaction Problems. 2 Outlines  Constraint Satisfaction Problems  Backtracking Search for CSPs  Local Search for CSP  The.
CSC 8520 Spring Paula Matuszek CS 8520: Artificial Intelligence Search 3: Constraint Satisfaction Problems Paula Matuszek Spring, 2013.
Chapter 5 Constraint Satisfaction Problems
Review Test1. Robotics & Future Technology Future of Intelligent Systems / Ray Kurzweil futurist Ray Kurzweil / A Long Bet A Long Bet / Robot Soccer.
Maintaining Arc Consistency (MAC) MAC is the same as Back-tracking, but with calls to AC-3 interleaved... function Backtracking-Search(csp) returns.
An Introduction to Artificial Intelligence Lecture 5: Constraint Satisfaction Problems Ramin Halavati In which we see how treating.
CHAPTER 5 SECTION 1 – 3 4 Feb 2004 CS Constraint Satisfaction 1 Constraint Satisfaction Problems.
How Do I Solve This Thing?. You are familiar with Sudoku puzzles. For this variation, place the integers 1 – 9 into each row or column such that the.
Monster (“Mega”) Sudoku
CompSci Problem Solving: Sudoku  Rules of the Game Sudoku is played with a 9 by 9 "board" consisting of nine 3 by 3 sub-boards. The symbols 1 -
CS 171: Intro to AI Discussion Week 2 Jan 15 th 2016.
1 Constraint Satisfaction Problems (CSP). Announcements Second Test Wednesday, April 27.
CMPT 463. What will be covered A* search Local search Game tree Constraint satisfaction problems (CSP)
CS 561, Session 8 1 This time: constraint satisfaction - Constraint Satisfaction Problems (CSP) - Backtracking search for CSPs - Local search for CSPs.
Constraint Satisfaction Problems (Chapter 6)
ECE 448, Lecture 7: Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSPs)
Constraint Satisfaction Problem
Advanced Artificial Intelligence
Lecture 7 Constraint Satisfaction Problems
Computer Science cpsc322, Lecture 14
CSP Search Techniques Backtracking Forward checking
Constraint Satisfaction Problems
Artificial Intelligence
Modeling Sudoku as a CNF Formula
Constraints and Search
Constraint satisfaction problems
Sudoku.
Modeling Sudoku as a CNF Formula
Constraint Satisfaction
CS 8520: Artificial Intelligence
Constraint Satisfaction Problems
David Kauchak CS51A – Spring 2019
Constraint satisfaction problems
Constraint Satisfaction Problems (CSP)
Presentation transcript:

Monster (“Mega”) Sudoku NxN grid, N = pq a composite number > 9 N symbols; generate them “odometer” style 1 … 9 A B … Z 11 12 … 19 1A … 1Z 21 … 9Z A1 … A9 AA … ZZ 111 112 … 9ZZ A11 … ZZZ 1111 … ZZZZ 11111 … ZZZZZ … N blocks, each with p rows and q columns The N blocks fit regularly into the NxN grid p blocks fit across the NxN grid rows (p blocks x q columns = N) q blocks fit down the NxN grid columns (q blocks x p rows = N) Some elements of the NxN grid already have symbols Fill in the rest of the NxN grid with symbols under constraints No symbol appears twice in any row No symbol appears twice in any column No symbol appears twice in any block Often called the “AllDiff” constraint

Examples

You Will Write Code: Code that inputs a Monster Sudoku puzzle Input parameters N, p, q to define the grid and blocks Which symbols already are on which grid elements Code that generates a random Monster Sudoku puzzle Input parameter M the number of symbols initially on grid Symbols are chosen and placed randomly respecting constraints Code that solves a Monster Sudoku puzzle Node consistency, arc consistency, path consistency (6.2) Backtracking search (6.3) Variable and value ordering: minimum-remaining values, degree heuristic, least-constraining-value (6.3.1) Forward checking (6.3.2) Extra Bonus Credit: Local search for CSPs: min-conflict heuristic (6.4)

You Will Analyze: For each value of N there is a “hardest” value of M For each of an increasing series of N, find the corresponding M How does M change as N increases? What is the biggest N for which you reliably solve the “hardest” M? How does solution time grow with increasing N for “hardest” M? What is the relative contribution of the various CSP heuristics?

Hard satisfiability problems

Hard satisfiability problems Median runtime for 100 satisfiable random 3-CNF sentences, n = 50