Advanced Algorithms and Problem Solving 2008 Week 1
Edmund Tse on Mar 24th 2008
This week we introduced the game Khiva and set two problems:
Running Median
Design a data structure + algorithm that will allow you to most efficiently keep a running median. I will give you numbers and tell you to remove certain numbers and at any point I could also ask you what the median is. All the operations should be reasonably fast.
Wall construction
You have a grid of squares, some of which contain walls. You want to fill in the minimum number of extra squares so that once you are done there is no path from the top of the grid to the bottom (movement is horizontal and vertical).
Khiva
You must design a bot to play a game called ‘Khiva’ – see its page for details.
Filed in Programming | No responses yet