Decius comments on Prisoner's dilemma tournament results - Less Wrong

32 Post author: AlexMennen 09 July 2013 08:50PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (122)

You are viewing a single comment's thread. Show more comments above.

Comment author: AlexMennen 11 July 2013 01:51:23AM 7 points [-]

When I first announced the tournament, people came up with many suggestions for modifications to the rules, most of which I did not take for the sake of simplicity. Maybe we should try to figure out what rules will make it easier to write more effective bots, even if that would disqualify many of the bots already submitted to this tournament.

Comment author: Decius 11 July 2013 05:40:02PM 1 point [-]

I think that the bots already submitted should be considered for grandfathering if the rules change to prohibit them.

I also have a specific entry in mind, but lack the expertise to go from 'flowchart' to 'code'.

Comment author: Andreas_Giger 12 July 2013 03:03:54PM 3 points [-]

I think there would more people interested in playing if strategies could be submitted in pseudocode, so that would be great.

Comment author: Decius 12 July 2013 05:34:33PM *  3 points [-]

For entries that only eval(opponent(x)), for simple x, that seems reasonable. Strategies that rely on deeper analysis would need to look for specific things about the code that I, as a non-programmer, cannot describe accurately.

Comment author: malcolmocean 14 July 2013 09:44:19AM 1 point [-]

I think that the bots already submitted should be considered for grandfathering if the rules change to prohibit them.

I would agree that they should compete even if they're not awarded prizes for winning. Because we should at least have a comparison with performance against old bots. More data is pretty much always better.

Comment author: Decius 15 July 2013 07:08:47PM 1 point [-]

It should also be trivial to calculate the score both in this heat and against all previously submitted bots.