Omniheurists 2004 (in alphabetical order):

- Chien-I Liao (Leon)
- Christopher W Quackenbush
- David Kaplin
- Jason Reisman
- John Lin
- Kai-Hui Huang (Kevin)
- Karven Lam
- Shoumen Saha
- Yusuke Shinyama

With thanks to Prof. Dennis Shasha and all participants.

- In this competition several people won the optimal result.
- Here is Leon's fast solution of mint problem.
- Here is Yusuke's solution and mint.c.
- Yusuke presented Python Advocacy page.

- David's architecture page.
- Winner (tournament): algorithm by Yusuke Shinyama.
- Winner (melee): algorithm by John Lin.

- Yusuke's architecture page. (This didn't work in the class.)
- Here are results recalculated after the class.

- Karven's architecture page
- Winner: algorithm by Jason Reismen and algorithm by Shoumen Saha.
- Here is John's solution.
- Here is Leon's solution.

- There is no architect this time. Outputs were reviewed manually.
- Winner: algorithm by jason reisman.
- Here is Yusuke's "beauty-oriented" algorithm.

- Chris' architecture page.
- Who was the winner?

- Shoumen's architecture page.
- Winner: algorithm by Karven Lam (earned most money).
- Here is Leon's algorithm (most wins).

David's Heurgame framework is an extensible framework written in Java. This is designed to build a multi-player battlefield used in the class. This framework was used in Voronoi, Nanomunchers, and Superply