You should prepare these exercises for oral presentation in tutorial.
In the transcript above there is a line: (ask (ask me 'location) 'name). What kind of value does (ask me 'location) return here? What other messages, besides name, can you send to this value?
Check the 6.001 discussion forum for tutorial-ex-01
|
Look here
for information about the forum.
| |
Look through the code in objtypes.scm to discover which classes are defined in this system and how the classes are related. For example, place is a subclass of named-object. Be prepared to draw the tree of subclass relationships and the messages that can be sent to each kind of object, using a diagram like the one presented in lecture on March 19. You will find such a diagram helpful (maybe indispensable) in doing the programming assignment.
Check the 6.001 discussion forum for tutorial-ex-02
|
Look here
for information about the forum.
| |
Look at the contents of the file setup.scm. What places are defined? How are they interconnected? Who is in each place in the initial state? Be prepared to draw a map. You must be able to show the places, the exits that allow one to go from one place to a neighboring place, the persons, the things, and the initial place for each person or thing.
Check the 6.001 discussion forum for tutorial-ex-03
|
Look here
for information about the forum.
| |
The avatar, as a person, may have possessions. How does the avatar handle the request (ask me 'possessions)? In particular, which method is used to respond to the request and which variable holds the list of possessions? Be prepared to sketch a skeletal environment diagram to explain your answer. Note that we are not asking you to draw a fully detailed environment diagram here--it is huge and useless!
Check the 6.001 discussion forum for tutorial-ex-04
|
Look here
for information about the forum.
| |
The file search-rooms.scm defines a search strategy maker that is similar to the search strategy maker you worked with in problem set 6. This week, you'll program a robot to follow this strategy to walk through a maze, searching for a valuable object. One difference between the robot version and the one for exercise 6 is the use of path procedures (implemented with make-path-procedures). What are these being used for? Why is this necessary for a robot walking through a maze but not for a spider crawling the Web as in exercise 6?
Check the 6.001 discussion forum for tutorial-ex-05
|
Look here
for information about the forum.
| |