6.2 Greedy User Prediction


  • Having worked through the previous exercises, now test your understanding of the operation of the Greedy search with the User Prediction mode.

  • Select the Single Step (User Prediction) from the Mode menu.

  • If necessary select the Tiles Out of Place heuristic from the Algorithm menu again.

  • We'll use the same problem as before. Click Start to begin.

  • You must predict the next node to be expanded by the Greedy search. Use the mouse pointer to identify your choice, then click the mouse button to see if you are correct.

  • The search space tree will only expand when you correctly click on the next node to be expanded. Continue attempting to predict the behaviour of the Greedy Search until the goal is reached.

  • Click on the Reset button so that new animation options can be selected ready for the next exercise.


[MAIN PAGE] [AI-SEARCH] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999. Department of Computer Science, RMIT University.
Last Modified: 20th June, 1999.