Hi, a similar variation of the idea can be found on http://infon.dividuum.de A nice feature o this game is that you can upload the (lua) code while the game is running, so the rounds tend to be quite long (~1h maybe) and the people can adjust their AI constantly. It was very popular at the last two GPN conferences in Karlsruhe. Greetings, Joachim Am Montag, den 16.07.2007, 11:31 -0400 schrieb Re, Joseph (IT):
Interestingly enough, we're doing something very similar for ACM@UIUC's 2007 MechMania XIII contest (http://en.wikipedia.org/wiki/Mechmania), an AI competition hosted during our annual Reflections Projections conference.
I can't release too many details until the day of the contest (Oct 13), but it's tactical, grid based combat game where you get one day to write an AI (while testing in a pre-arena of sorts that is rendered to a video wall in the middle of the conference building's atrium) and then the next morning we run a (usually double elimination) tournament and display all the simulations on a giant projector. You can look at screenshots / client API docs from 2006 as an example until we post the details the night of the contest.
After the contest we post results, (hopefully) clean up the code, and release it for people to play with. We're not professionals, nor do we mainly write games, but it should be clean enough for someone to modify and play around with.
I guess it goes without saying that you can actually enter the contest proper by coming to the conference if you happen to live in the middle of nowhere (Champaign-Urbana, IL USA). Registration will be up (www.acm.uiuc.edu/conference/) towards the end of summer.
________________________________
From: haskell-cafe-bounces@haskell.org [mailto:haskell-cafe-bounces@haskell.org] On Behalf Of Hugh Perkins Sent: Sunday, July 15, 2007 2:47 PM To: haskell-cafe Subject: [Haskell-cafe] Haskell shootout game
Had an idea: a real shootout game for Haskell.
The arena itself comprises: - a 2d grid, of a certain size (or maybe variable size) - each grid cell can be a wall, or one of the opponents - the boundaries of the grid are walls - random blocks of wall are placed around the grid
This can run on a hosted webserver probably, because each match is part of a webpage request, and lasts a maximum of about a second, so shouldnt be terminated prematurely by cpu-monitoring scripts. --------------------------------------------------------
NOTICE: If received in error, please destroy and notify sender. Sender does not intend to waive confidentiality or privilege. Use of this email is prohibited when received in error. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
-- Joachim "nomeata" Breitner mail: mail@joachim-breitner.de | ICQ# 74513189 | GPG-Key: 4743206C JID: joachimbreitner@amessage.de | http://www.joachim-breitner.de/ Debian Developer: nomeata@debian.org