## Game (continued)

### First download `h8.tar`

. Modify
`main.ml`

to use your server name and port number. Then all
your changes should be in `player.ml`

.

The description is the same as the one for assignment 7. The
*minimum* requirements for the files you turn in this week are:
- Random walk for your robot but which avoids obstacles and
edges (does not drown itself, does not walk into walls, does not
attempt to go beyond the boundaries of the board).
- The robot should always have the optimal list of packages from
among all the packages it has seen during the random walk. This
requires the use of the knapsack algorithm. You might need to refine
the function which estimates the cost associated with a package given
the distance to its home and its weight. For the purposes of this
assignment you may assume the maximum number of packages to be 100
(there is no need to optimize the knapsack algorithm beyond what we
had already done).