2014 AI&Simulation

Midterm Project

(Due date: May 13)

1. Search problems
A. Answer the following problems regarding the graph below.
3.5

3.1

3.2
S

3.8

2.5

2.3

4
3

2.9
D

2.4

2.5

S: initial node

G:goal node

When a node has more than one child, arrange them in alphabetical order.

1. Draw the complete search tree that shows all the search paths.
2. Draw the search tree of depth first search. What is the search path?
3. Draw the search tree of breath first search.

What is the search path?

4. Draw the search tree of branchand-bound search. What is the search path?
5. Draw the search tree of branch-and-bound with dynamic programming.

B. Implement the function using scheme language.

1. Implement the hill-climbing search function and test with the graph in the class note.
2. Implement the beam search function and test with the graph in the class note.
3. Implement the branch-and-bound with dynamic programming search function and
test with the graph shown above (problem A).
4. Implement the A* and test with the graph in the class note.
Submit the source code and execution results.

2. Rule-based Expert System Implementation.

Help the 3 cannibals and the 3 missionaries to move to the other side of the river.
Notice that when there are more cannibals than missionaries on one side, they eat
them.
There is only one boat available and the capacity of which is two.

Initial state:

All at the left side of the river.

Goal state:

All at the right side of the river.

Determine how to represent the states (initial state, intermediate states, goal
state)
Define facts
Define rules (try to minimize the number of rules)
The rules must have text field for monitoring the execution process.
Print the rule number and state, and draw a diagram (as shown below) each a
rule is executed.
Diagram examples )

MMMCCC | |
MMCC | |

MC

...

Submit the report including source code and execution results in

hardcopy.