Problem 653. Steal, Share, or Catch: Tournament of Champions

Created by Doug Hull

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>I am no longer supporting this problem. No changes will be made to put more entries in the test suite, but have fun playing anyways!</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/650-steal-share-or-catch\"><w:r><w:t>Steal, Share, or Catch</w:t></w:r></w:hyperlink><w:r><w:t> is explained in the link.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is the \"Tournament of Champions\". If you make a passing entry in the original, from time to time I will move entries over to this Cody problem. You will no longer be playing against only easy characters:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Good</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Evil</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Chaos</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Doug</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You will face</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Vincent</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Sean</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>James</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Exploiter</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Philipp</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Bert</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"ListParagraph\"/><w:numPr><w:numId w:val=\"1\"/></w:numPr></w:pPr><w:r><w:t>Amro</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Exploiter recognizes the strategies of many of the above characters, and plays well against them.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Is this cheating? Maybe, but</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Security_through_obscurity#Arguments_against\"><w:r><w:t>security through obscurity</w:t></w:r></w:hyperlink><w:r><w:t> is questionable! Take a look at Exploiter, it is the reference solution to this problem.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>I will update the test suite and cast of characters and winning score as we go. I will try to keep making the test suite tougher so that only one/two entries can pass it at any given time. It will be a matter of beating the test score more than getting lowest complexity!</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If you made something and want to see it here, just call my attention to it.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Winner is determined by score, not by length. As of 6/28/2012 on my machine Amro is the current winner at 136K!</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

I am no longer supporting this problem. No changes will be made to put more entries in the test suite, but have fun playing anyways!<a href = "http://www.mathworks.com/matlabcentral/cody/problems/650-steal-share-or-catch">Steal, Share, or Catch</a> is explained in the link.This problem is the "Tournament of Champions". If you make a passing entry in the original, from time to time I will move entries over to this Cody problem. You will no longer be playing against only easy characters:<ul><li>Good</li><li>Evil</li><li>Chaos</li><li>Doug</li></ul>You will face<ul><li>Vincent</li><li>Sean</li><li>James</li><li>Exploiter</li><li>Philipp</li><li>Bert</li><li>Amro</li></ul>Exploiter recognizes the strategies of many of the above characters, and plays well against them.Is this cheating? Maybe, but <a href = "http://en.wikipedia.org/wiki/Security_through_obscurity#Arguments_against">security through obscurity</a> is questionable! Take a look at Exploiter, it is the reference solution to this problem.I will update the test suite and cast of characters and winning score as we go. I will try to keep making the test suite tougher so that only one/two entries can pass it at any given time. It will be a matter of beating the test score more than getting lowest complexity!If you made something and want to see it here, just call my attention to it.Winner is determined by score, not by length. As of 6/28/2012 on my machine Amro is the current winner at 136K!

Solve

Solution Stats

315 Solutions
9 Solvers

Last Solution submitted on Apr 24, 2019

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Amro on 28 Jun 2012

what is the best score so far? (not size/complexity)

Richard Zapor on 29 Jun 2012

Just scored 220,000 :)

Problem Recent Solvers9

Problem Tags

gametheory ml101

Problem 653. Steal, Share, or Catch: Tournament of Champions

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers9

Suggested Problems

More from this Author52

Problem Tags

Problem 653. Steal, Share, or Catch: Tournament of Champions

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers9

Suggested Problems

More from this Author52

Problem Tags

Players