1.2 Examples of Solving
Problems with Search


  • Before deciding on a move, a chess player will consider a number of possibilities, weighing up the probable benefits of each.

  • When trying to solve Rubik's cube, a person may try a few moves "in their head" before deciding on the next move.

  • To solve a maze, we may follow some path which leads to a dead-end. We then have to go back to a previous choice-point and try an alternative.

  • In deciding to travel, say from Arad to Bucharest, we would look at different routes on the map before choosing one.

[Main Page] [Previous Page] [Next Page]
RMiT Copyright © 1999-2002. School of Computer Science &
Information Technology, RMIT University.
Last Modified: 10th January, 2002.