Skip to: site menu | section menu | main content


“Either write something worth reading or do something worth writing.” --Benjamin Franklin


  • Hamed's Introduction to Game Algorithms (2003)
    In my freshman year of college, a lot of people asked me how I had written a program that could play chess. Therefore, I wrote an article explaining basic minimax game tree search techniques, as well as touching on some slightly more advanced topics like alpha-beta pruning and quiescence search. To my surprise, it quickly became quite popular on the internet, despite its simplicity. I present it here in its unmodified original form.

Published Papers

The following papers were a result of some research I took part in during 2003-2004. Click on the links to downoad/view in PDF form.

Back to top