Courses/CS 460/Fall 2006/Garg, Deepak

From CSWiki

Deepak Garg

Email :DeepGarg@gmail.com

Contents 1 My Fav Links 2 Homework 3 Oct 7 2006 4 Oct 14 2006 5 Oct 21 2006 6 Oct 28 2006 7 Nov 4 2006 8 Nov 11 2006 9 Nov 18 2006 10 Nov 25 2006 11 Dec 2 2006

[edit] My Fav Links

• Eight queens puzzle

[edit] Homework

[edit] Oct 7 2006

• dgExp1
• dgExp2

[edit] Oct 14 2006

• It would be easier to see what's on this page if you would put code examples on sub-pages. Thanks.

Russ Abbott 19:23, 13 October 2006 (PDT)

---

Java Code 1 : Kakuro

• Kakuro.txt

Java Code2 : Kakuro

• Kakuro1.txt

[edit] Oct 21 2006

Homework 4

Problem : Missionaries & Cannibals Problem: Help the 3 cannibals and 3 missionaries to move to the other side of the lake. Note that: when there are more cannibals on one side than missionaries, the cannibals eat them. How to play: Click on a cannibal to put him on the boat and also click on the missionary to put him on the boat. In order to move them to the other side of the lake, click the GO button at the top of the screen. Code :

• hw4Exp1

Three Water Jug: The premise of the puzzle is simple. You have a well, and two water jugs of different sizes. The idea is to get a specific amount of water in one of (or both of) the jugs. In doing so, you are allowed to:

Fill up either jug completely Empty either jug completely Pour water from one jug to the other, until the poured jug is empty, or the other jug is full You are not allowed to do anything else, such as fill up a jug to a specific level - it is assumed that there are no ways Code:

• ThreeWaterJug

[edit] Oct 28 2006

Homework 5

Missionaries & Cannibals Problem by breath search Code :

• hw5Exp1

Exp: How to find the shortest path between two words Code:

• searchtest

[edit] Nov 4 2006

Homework 6

[edit] Nov 11 2006

Homework 7

Implement arithmetic constraints NEqualsC ( Still workig on it to solve SendMyMoney Code :

• NEqualsC

---

Are you sure you need NEqualsC for SendMoreMoney? How about writing the code for SendMoreMoney first and then see which constraints it really uses. By the way, Rick has implemented XplusYeqZ and XplusYeqC. You might want to look at his. Set yourself up with Subversion so that you can check out the code. Follow Rick's instructions on the course Discussion page.

Russ Abbott 20:34, 16 November 2006 (PST)

[edit] Nov 18 2006

Working on experiment with and explain Java Constraint Handling Rules (JCHR) with Gioung , Joan and Deepak ( )

[edit] Nov 25 2006

Working on experiment with and explain Java Constraint Handling Rules (JCHR) with Gioung , Joan and Deepak

[edit] Dec 2 2006

Topic to covered in JCHR (Java Constraint Handling Rules ) Presentation
 
	JCHR    Introduction 
	
        CHR
		Introduction 
		Syntax
		Operational Semantics
		Example
	CHR-v
		Introduction 
		Operational Semantics
		Example
	
	Constraint Program Solvers
	        Introduction 
		Syntax
		Example
        
       JCHR complex example : Less then or Equal
 
       JCHR complex example : Sudoku 	
        
        Help 
            JCHR Installation
            References