Posted At: Wednesday, June 20, 2007 2:50
Conversation: 2006.6.20 Meeting
Posted To: 2.Meeting
Subject: 2006.6.20 Meeting
On June 20th Mike and
Kelvin met at Kelvin’s Office. The following are records from our
Othello assignment: we have decided this assignment is too advanced to be a
“1-D array” assignment. We will keep this assignment and figure out where to
and Rope: instead of racing to the goal, here, players traverse the grid in
search of gold. Player iterate through each grid cell, if they pass through a
cell with gold, they get the points and the gold pot disappear. There are a
limited set of gold pots. Each turn a player can:
die: get a number between 1-4 and advance by that
a chance: create/edit a ladder or rope
ladder/rope exists, it will be modified (type won’t change, but
ladder/rope does not exist, a random one will be created and
1-D array represent the play map, a separate smaller 1-D array of references
to the gold pot.
goldPot: pts, Location (in the map), string reference to image for
drawing, and a valid flag (already taken ).
of assignment: 1D array of reference to objects
through: (to look for an item)
edit the elements of the array
with null reference in array
assignment for Mod-And-Operator
student XNA_Description for the assignment
sure all our links works fine in the new CVS
will finish the above items and send Kelvin an email on Thursday night.
Kelvin will package all the materials and send it to
next Wednesday (next meeting at 1pm on next
list: simple pong-like bouncing game (for Help Desk link
both assignment, Kelvin will finish the XNA assignment and the Student
the assignment spec (pre/post test, grading rubric,
the C++ solution to C#.
finish the assignment spec (pre/post test, grading rubric,
goal is to hand Ruth LinkList (Pong-like game) and 1-D array (Rope+Ladder)
by next Friday.
must work out the last game on next Wednesday.