Problem 650. Steal, Share, or Catch

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>You, I, and a few other characters are going to play a game of</w:t></w:r><w:r><w:t> </w:t></w:r><w:r><w:rPr><w:b/></w:rPr><w:t>Steal, Share or Catch</w:t></w:r><w:r><w:t>. We are going to play it 10,000 times vs. each of the characters.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The rules of the game are this:</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>There are two points available each round</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>We will both choose to either Steal, Share, or Catch</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>If we both choose Share, we both get one point.</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>If one chooses Steal and the other Share, the Stealer gets two points.</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>If one chooses Steal and the other Catch, the Catcher gets two points.</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>Any other combination, no one is awarded points.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You are to write an algorithm that will return either</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>-1: Steal</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>0: Share</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>1: Catch</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>To help you make your choice, you will have a history vector that shows what your choices have been so far, and what the opponent's choices have been. These histories are in the form of:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[[-1\n 1\n 1\n 0]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Meaning that the first round there was a Steal, then two Catches, then a share.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The characters you will play against are:</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 (always steals)</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 (always shares)</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 (randomly chooses)</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 (Something more complicated)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>As this problem runs, I will take the better entries and add them into the cast of characters that you play against. Maybe in a different Cody problem though.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The scores to beat are:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[terribleScore = 0; % works\nbadScore = 23000; % good strategy scores this\nokScore = 26000; % evil strategy scores this\ndecentScore = 29000; % chaos strategy scores this\ngreatScore = 42000; % doug strategy scores this]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>If you can make a winning solution here, it might be added to the </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.mathworks.com/matlabcentral/cody/problems/653-steal-share-or-catch-tournament-of-champions\"><w:r><w:t>Tournament of Champions</w:t></w:r></w:hyperlink><w:r><w:t> version of this problem. E-mail me if you want yours added.</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>"}]}

You, I, and a few other characters are going to play a game of Steal, Share or Catch. We are going to play it 10,000 times vs. each of the characters.The rules of the game are this:<ul><li>There are two points available each round</li><li>We will both choose to either Steal, Share, or Catch</li></ul><ul><li>If we both choose Share, we both get one point.</li><li>If one chooses Steal and the other Share, the Stealer gets two points.</li><li>If one chooses Steal and the other Catch, the Catcher gets two points.</li><li>Any other combination, no one is awarded points.</li></ul>You are to write an algorithm that will return either<ul><li>-1: Steal</li><li>0: Share</li><li>1: Catch</li></ul>To help you make your choice, you will have a history vector that shows what your choices have been so far, and what the opponent's choices have been. These histories are in the form of:<pre class="language-matlab">[-1
 1
 1
 0]
</pre>Meaning that the first round there was a Steal, then two Catches, then a share.The characters you will play against are:<ul><li>Evil (always steals)</li><li>Good (always shares)</li><li>Chaos (randomly chooses)</li><li>Doug (Something more complicated)</li></ul>As this problem runs, I will take the better entries and add them into the cast of characters that you play against. Maybe in a different Cody problem though.The scores to beat are:<pre class="language-matlab">terribleScore = 0; % works
badScore = 23000; % good strategy scores this
okScore = 26000; % evil strategy scores this
decentScore = 29000; % chaos strategy scores this
greatScore = 42000; % doug strategy scores this
</pre>If you can make a winning solution here, it might be added to the <a href="http://www.mathworks.com/matlabcentral/cody/problems/653-steal-share-or-catch-tournament-of-champions">Tournament of Champions</a> version of this problem. E-mail me if you want yours added.

You, I, and a few other characters are going to play a game of *Steal, Share or Catch*.  We are going to play it 10,000 times vs. each of the characters.

The rules of the game are this:

* There are two points available each round
* We will both choose to either Steal, Share, or Catch

* If we both choose Share, we both get one point.
* If one chooses Steal and the other Share, the Stealer gets two points.
* If one chooses Steal and the other Catch, the Catcher gets two points.
* Any other combination, no one is awarded points.

You are to write an algorithm that will return either

* -1: Steal
*  0: Share
*  1: Catch

To help you make your choice, you will have a history vector that shows what your choices have been so far, and what the opponent's choices have been.  These histories are in the form of:

[-1
    1
    1
    0]

Meaning that the first round there was a Steal, then two Catches, then a share.

The characters you will play against are:

* Evil  (always steals)
* Good  (always shares)
* Chaos (randomly chooses)
* Doug  (Something more complicated)

As this problem runs, I will take the better entries and add them into the cast of characters that you play against.  Maybe in a different Cody problem though.

The scores to beat are:

terribleScore   =     0; % works
  badScore        = 23000; % good  strategy scores this
  okScore         = 26000; % evil  strategy scores this
  decentScore     = 29000; % chaos strategy scores this
  greatScore      = 42000; % doug  strategy scores this

If you can make a winning solution here, it might be added to the <http://www.mathworks.com/matlabcentral/cody/problems/653-steal-share-or-catch-tournament-of-champions Tournament of Champions> version of this problem. E-mail me if you want yours added.

Solve

Solution Stats

594 Solutions
78 Solvers

Last Solution submitted on Jun 06, 2021

Last 200 Solutions

Problem Comments

Solution Comments

Solution 1250902

1 Comment

1 Comment

yurenchu on 14 Aug 2017

56710

Solution 1250867

1 Comment

1 Comment

yurenchu on 14 Aug 2017

56582

Solution 1114317

1 Comment

1 Comment

Daniel Pereira on 2 Feb 2017

56477

Solution 182121

1 Comment

1 Comment

Alfonso Nieto-Castanon on 27 Dec 2012

56416

Solution 86759

1 Comment

1 Comment

Albert Yam on 8 May 2012

I lost to Doug.

Problem Recent Solvers78

Problem Tags

gametheory ml101

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!