April
1999 QUESTION 3 Total Marks: 20 Marks |
Click here to access other
questions
Click to access
|
| Problems can be represented as sets of facts
and rules, or graphs. To solve the problems, reasoning can be applied on the facts and
rules, or the graphs can be searched.
|
||
| (a) | There are four reasoning methods that can be
applied on propositional and predicate logic. Name and use symbols and connectives to show
the four reasoning methods.
|
[4] |
| (b) | There are basically two types of search techniques: exhaustive search and heuristic search. | |
| (i) Compare exhaustive and heuristic searches. | [4] | |
| (ii) state and define the two types of search
classified under exhaustive search.
|
[4] | |
| (c) | Describe and give an example of state space.
|
[4] |
| (d) | In the few decades of computing history, it is only in the last few years where scientists have implemented a computer system that managed to defeat a world class chess master. If the game is staged again today, can we guarantee that the computer system will once again defeat the chess master? Explain your answer. | [4] |