What is the contest?
A game called spoons(i posted the idea as a response in my original sugestion). The normal version works with 5 rows of 1,3,5,7,9 spoons, and each player takes as many spoons as he wishes from one row at a time. The loser is he who take the last spoon. 1st and 2nd players are chosen randomly. As this game is actually a forced win with only 5 rows, I now opt for n > 100 rows, with the number of spoons increasing in odd numbers (2n-1) per row. Each entry is really a subroutine, and the subroutine is passed 2 arrayrefs, 1 with n elements, with the number of spoons in a row such as an array of (1,0,0,1,3,5,2,3) if there are 8 rows, with index 0 being the top of the triangulars shaped game, and 7 being the bottom. the other arrayref has the elements (n,m) where n=number of spoons last taken by opponent, and m=from what row the opponent took the spoon. The subroutine returns an array containing how many spoons it took, and from what row. If the move was impossible, than the subroutine is disqualified(and to prevent slaves being disqualified to masters, all games with that subroutine are null and void). all moves must occur within less than 20 minutes.

How will entries be submitted?
They will be emailed to a specific email address, with a _start_ and an _end_ block around the script.

How will the entries be scored?
They will be played against eachother in a script that plays the subroutines against eachother some number of times (let's say 10? maybe another). The winning script at the end of each match, gets 1 point. The full winner wil have the most points, in the case of a tie, the tied scripts will play in a best 5 out of 9 play off.

<STRON