CS241: Implementing a game tree & Hashmap

1. lab
2. Education and accreditation (repris)
3. Any implementation issues that I could help with? Here's my implementation plan...
   1. Start with input from file -- see April6_GameProto in examplesFromClass
   2. Add graphical output of Board
   3. Complete the Board class
      1. Finish & test BoardList generateNextLegalBoards()
      2. Write gameOver()
      3. Write void paint(Graphics, Rectangle)
   4. Add NaryTree -- see April3_Board
   5. Draw the NaryTree graphically
   6. Implement AIs (so to speak); add user controls for playing
4. Hashtables and HashMaps
   1. What if look-up needs to be faster than O(n) or O(logN)? E.g. your web server is getting thousands of hits/second...
   2. Need a way to access large database (of elements) in small constant time
   3. A trick: come up with a function to create a key from an element, and map from a key directly to that element in the database
   4. Silly example: dictionary of words, hashKey=first letter
   5. Oops! Collisions!
   6. googled java tutorial hashmap