Courses/CS 460/Fall 2006/Shakil, Farrukh

From CSWiki

Contents 1 Introduction 2 Interesting Constraint Programming Resources 2.1 OPL Studio 3 Week 1 3.1 Homework1 4 Week 2 4.1 FDStore 4.2 MotorCycle Rally 4.3 Little Lost Child 4.4 Europian Vacation 5 Week 3 6 Queens 7 Week 4 8 Week 5 8.1 Missionaries and Cannibals 9 Week 6 9.1 Missionaries and Cannibals using Search Algos 10 Week 7 11 Week 9 12 Final Week

[edit] Introduction

Author: Farrukh Shakil
Email: fshakil@calstatela.edu
Course: Artificial Intelligence(CS460)
Instructor: Dr. Russell Abbott

[edit] Interesting Constraint Programming Resources

[edit] OPL Studio

[edit] Week 1

[edit] Homework1

[edit] Week 2

[edit] FDStore

[edit] MotorCycle Rally

[edit] Little Lost Child

[edit] Europian Vacation

[edit] Week 3

Modified Sudoku

Kakuro ( )

[edit] Queens

[edit] Week 4

Choco VS JaCoP ( )

[edit] Week 5

[edit] Missionaries and Cannibals

[edit] Week 6

[edit] Missionaries and Cannibals using Search Algos

[edit] Week 7

[edit] Week 9

Parallel Searcher ( )

here is an XML build file for Joan, Gioung and Deepak

build.xml

Note: this one is for linux, for windows or mac modify it accordingly ( change forward slash to back slash )

Farrukh, When we talked in class we said that each thread should be given an element from the frontier list and send back a list of successor elements. Let's modify that slightly so that a thread sends back individual successor elements as soon as it generates them. The overall framework is the same. It's just that the threads do not accumulate successor elements and send them back all at once. It sends them back one at a time as they are generated. Russ Abbott 19:40, 18 November 2006 (PST)

[edit] Final Week

Searcher.java
ParallelSearcher.java
SearchThread.java

Jar File
http://digitalthinkers.net/cs460.jar