Slashdot Log In
Rules-Unknown Artificial Intelligence Competition
Posted by
timothy
on Sun Aug 05, 2001 03:12 AM
from the sorry-not-as-much-as-for-solving-poe-codes dept.
from the sorry-not-as-much-as-for-solving-poe-codes dept.
OOglyDOOde writes: "This link points to a competition being hosted by a company that makes research on artificial intelligence. The task? Build a program that can play a number of games whose rules are totally unknown -- and earn the best score while competing against various opponents. Your program is told the possible choices available, when it should make a move, what did the opponent do; and what was your score for the last turn. There are no entry fees yet there is a cash prize. Submissions can be done in various languages, or in Linux or Windows binaries." This is certainly one of the odder ones I've ever seen, but has interesting prizes (trip to Israel) and rules (fairly broad entry categories).
This discussion has been archived.
No new comments can be posted.
Rules-Unknown Artificial Intelligence Competition
|
Log In/Create an Account
| Top
| 176 comments
| Search Discussion
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
My Statistics Professor Has Already Done This (Score:5, Insightful)
This code could be similarly adapted to any game, inasmuch as the code can register a table with all the possible moves provided by the interface. It doesn't even have to know what those moves do; it only needs to know if, by doing certain moves according the "state" (or the attributes) of the game, it gains points (or stays alive or whatever) or loses points. The moves are then given a distribution weighting factor. Then, the algorithm just needs to approximate the game state with the registered table entries, determine which moves have the highest "survival rate" based on the current game attributes, and then perform those moves.
Depending on the game, it may take a long time before the random variable distribution table gets populated to the point where the algorithm can make "intelligent" decisions, but it works nonetheless.
Even if I could write this program i wouldn't... (Score:1, Flamebait)
Going through UN archives or resolutions, even the United Nations condemns Israel for taking the land by force the way they did. And what's more ridiculous, is that now they say "You palestinian's shouldn't fight us, we're ready to make peace on our Israeli terms". Ridiculous! That's like me walking into Taco's home and kicking his butt out and then when he fights back, I cry to all of Slashdot saying he is psychotic. And when that's over, I tell him that he can live in the mulch pile in the back which I sleep in his room.
I know this message will get moderated down to -1, and is it doesn't people will sit here an attack me. Both sides have done wrong, I just think the people who started it (Israeli's) should take their stuff and walk away. Didn't the holocaust help them realize anything? What's ironic is that the holocaust of 21st century is being conducted by the Israeli's and our US taxpayer money supports them with weapons!
Ultimate lameness...!
some design specs for potential participants (Score:4, Informative)
After reading the guidelines to the contest, I figured I'd offer the following models/design specs for those interested in participating:
Some black humor (Score:1, Funny)
How will they do this? (Score:1)
A round-robin tournament will be held to select the winner of the Learning Machine Challenge. All combinations of players will take part in all games, of which there will be between six and twelve.
As I see it, they plan to let every contestant play against every other, on 6-12 games, several thousand moves each.
Where will they find the time to do this if they get more than just a few dozens of entries?
Interesting (Score:1)
The simple solution (Score:1)
Even more interesting... (Score:1)
User-submitted binaries? (Score:1)
Somehow, I don't get the feeling that these people have planned this very thoroughly. There are other little things that don't quite seem right, too...
Easier than I feared (Score:3, Interesting)
I was under the misconception that at each turn in the game, the judge will inform the player of all possible moves (as in chess, checkers, or the like) but looking at the specification, it seems that the moves are detailed at the outset of the game, and then are available to each player at each stage in the game.
now the odd thing to me is the measure of 'state' in the game. Is the score that's returned after each move the current cumulative score, the score for that move alone, or what? Also, what is the goal of the game? It would be short-sighted to assume it's to amass the highest score. In effect, the score is just another input variable, along with the opponents move, which may or may not be useful for judging what is a good move or a bad move.
For example, if you were trying to make an algorithm to solve the A8 puzzle (the 'sliding tile puzzle' with 15 tiles and 16 spots), and the computer judged your score by totalling up manhattan distances to the goal state, that may or may not be a fair scale of how many moves away you are from winning in an ideal case.
The system is still underspecified. Without knowing what 'score' means, and whether it is an estimate or a deterministic function, then the project is pretty much a game of luck, and coding is not an effort of skill.
Offtopic: Trip to Israel (Score:5, Funny)
Of course, there may be some connection between the prize and the game ("win a conflict where you've got no clue of the rules", that pretty much sums up the problems of both parties in the Middle East).
The game is Slashdot, the score is Karma. (Score:2)
But seriously. How can one consider this contest artificial intelligence? It's not like the entries have to be intelligent. They just have to be logical and well designed, and good at pattern recognition.
Look at chess as an example. This is like having a chess computer that has to learn the rules. Compared to playing chess (which is computable), learning the moves is relatively easy.
Paranoia (Score:1, Interesting)
This should prove entertaining. (Score:3, Interesting)
Calvinball (Score:5, Funny)
It's called Calvinball, and it's the sport of kings.
That recall me a couple of clever hack... (Score:5, Interesting)
The entries had to be given in the form of a subroutine that played the next move (given the current score and the history). The judges were linking two of them together and run the resulting binary.
Of course, there have been an entry that looked in the stack and modified the scores.
But the greatest was one (IMHO) that fork()ed and returned one possible response in each of its child. At next turn, the one that did not make the point (ie: had top score), exit()ed.
Mind-blowing. Found the link [ualberta.ca]
That program was the "Fork Bot"
Cheers,
--fred
AI? (Score:1, Funny)
Sincerely, Mike Bouma
Why not pick a real problem? (Score:1, Flamebait)
random fortune... (Score:5, Insightful)
Re:MOD UP! (Score:4, Insightful)
Otherwise known as the seminal work of AI philosophy.
This is truly on topic, moreso that the un-enlightened could ever know. ask yourelf: Are my mod points the mod points of the un-enlightened? if no, please mod up the parent's parent as +1, Insightful.
thankyou.
All Sample games only work by Collusion! (Score:1)
hmm (Score:1)
Damn (Score:1)
How many actual AI researchers reading slashdot? (Score:4, Funny)
Doing that and dumb enough to waste his time with this. Count me one.
tit-for-tat algorithm (Score:4, Interesting)
If this is a 2+ player competition and they're the right sorts of games (like the rock-paper-scissors game that it mentioned), whoever wins it might have to figure out a way to consistently beat the tit-for-tat algorithm.
Tit-for-tat [umich.edu] is one of the dead simplest game playing algorithms, and collectively it's one of the most successful.
It's based on the rule of "always do what the other player did last move". Under most circumstances it's impossible for it to actually win a game because the other player is always one step ahead. But its strength is in winning tournaments.
While it always loses, it never loses by much. This is different from other algorithms which usually have about as many weaknesses as they have strengths and will usually flunk out in at least some trials.
If someone can beat it consistently in a tournament situation, they really will have accomplished something in AI. Of course, this whole thing depends on exactly how the rules are structured, the scoring system and the information available to the program.
A lot easier for AI when... (Score:1)
Two thoughts (Score:4, Insightful)
2. I wonder whether the winner could visit me.
:-)
Exercise in neural networks (Score:2, Insightful)
The challenge is so obscure that any entry submitted will have to deploy a very generic NN and a trainer. this basicly means that after enough training any entry would do sufficiently good at any simple game (such as scissors, rock, paper) but playing anything more complex than
that is shooting in the dark. The interface and the rules of the challenge themselves are too obscure.
If there is someone with a code that could win such uncertainty effectively and efficiently, he'd be stupid to submit it for $2000.
Then again I must give a person that can do something extraordinary as that some credit for not doing something that stupid.
I might know how to win or get an unfair advantage (Score:4, Interesting)
rand() (Score:2, Interesting)
humans? (Score:1)
How they pay for the prizes... (Score:5, Insightful)
Wish I'd thought of it!
95% of the solution is written already: (Score:1)
The reason for such a generic interface... (Score:1)