Back in the Old Days text adventure games were a popular genre of computer games. These games had an interface that is reminiscent of command line interfaces. During a project in your computer archaeology unit, you have discovered an interesting example of a text adventure game, called Bork. Bork seems to take place in a place with strange multi-dimensional space-time, and your attempts to map out the locations in the game have so far been thwarted. You decide to automate the process and you soon have a programmable interface working. From the interface you can identify your current location (through the description of the location, which is unique to that location), get a list of exits from the current location, or mow to a new location by choosing an exit. Now you need to decide how to map out the game.

a. Describe how you can use a graph to model the locations in the game and which other locations you can visit directly from each location. You must specify what the vertices and edges are and how they correspond to elements in the game.

b. Discuss a graph traversal strategy (breadth first or depth first) that would work best in this scenario to map out the locations in the game using the graph model that you suggested above. Be sure to mention the advantages of your chosen strategy for this scenario, and the disadvantages of the other strategy.

c. Suppose you have built your graph mapping out the game. Discuss one graph related algorithm discussed in class and how it could be usefully applied to your graph in playing Bork.

Answer rating: 100% (QA)

a We will model this game as graph with the vertices representing the different locations ... View the full answer