|
|
Chapter 11
|
Deadline: 1385/3/15
|
|
|
» Assignment File:
|
» Comments:
Implement either POP or Graph-Plan on a hard-coded domain without variable-instantiating.
– Send To: sharifian@ce.sharif.edu
– Subject: AIEX-C11 |
|
|
|
|
Chapters 7,8,9
|
Deadline: 1385/3/1
|
|
|
» Assignment File:
|
» Comments:
Implement one of the 3 algorithms to solve a problem like that of Colonel West.
Send To: sharifian@ce.sharif.edu
Subject: AIEX-C9 |
|
|
|
|
Chapter Six
|
Deadline: 1385/2/12
|
|
|
Excercise 6.16
Send to n_ghanbari@ce.sharif.edu
Subject: AIEX-C616 |
|
|
|
|
Chapter 4's Exercise
|
Deadline: 1385/1/27
|
|
|
» Assignment File:
|
» Comments:
One of exercises 4.15 - 4.18
Send to n_ghanbari@ce.sharif.edu
Subject: AIEX-CH415 .. CH418 |
|
|
|
|
Chains Problem
|
Deadline: 1384/12/21
|
|
|
Assume a set of N chain links with some apriory connections. Assuming an operator that connects/disconnects two links. Formulate a search problem and find the optimal solution from a given initial state to a given goal state.
(SIMILAR TO EXERCISE 3.15 OF OLD TEXTBOOK)
The input and output will be the number and sizes of linear links ( a series of chains, connected together, forming a line ) and number and sizees of circular links ( a series of chains, connected together and forming a line)
For example, you know that the input is a 3-chain line, a 4-chain line and an 8-chain circle and the output is a 15-chain circle. You must specify a sequence of actions, starting from input state and reaching to the last state.
Try to respond the shortest path, but this is not mandatory.
Send to n_ghanbari@ce.sharif.edu
Subject: AIEX-CHAIN |
|
|
|
|
Missionaries and Cannibals
|
Deadline: 1384/12/21
|
|
|
Implement the missionaries and cannibals problem and use an a search method to find the shortest path. Is it useful to keep track of repeated cases?
(SIMILAR TO EXERCISE 3.9 OF TEXTBOOK)
Send to n_ghanbari@ce.sharif.edu
Subject: AIEX-CANNIBALS |
|
|
|
|
