shokwave comments on Prisoner's Dilemma Tournament Results - Less Wrong

101 Post author: prase 06 September 2011 12:46AM

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

Comments (170)

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

Comment author: shokwave 06 September 2011 06:26:54AM 7 points [-]

You get a copy of the other bot's source code and are allowed to analyze it. All bots have 10,000 instructions per turn, and if you run out of time the round is negated (both players score 0 points). There is a standard function for spending X instructions evaluating a piece of quoted code

I assume that X is variable based on the amount of quoted code you're evaluating; in that case I would submit "tit for tat, defect last 3" but obfuscate my source code in such a way that it took exactly 10,000 instructions to output, or make my source code so interdependent that you'd have to quote the entire thing, and so on. I wonder how well this "cloaked tit-for-tat" would go.

Comment author: lessdazed 06 September 2011 07:04:19AM 11 points [-]

My submitted bot would defect whenever it couldn't finish its calculation.

Comment author: shokwave 06 September 2011 08:46:18AM 5 points [-]

Good point. Obfuscated decision process is evidence of sneakiness. Like hiding a negation somewhere you think they won't look.