Problem 334. Poker Series 03: isFullHouse

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>The Poker Series consists of many short, well defined functions that when combined will lead to complex behavior. Our goal is to create a function that will take two hand matrices (defined below) and return the winning hand.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A hand matrix is 4x13 binary matrix showing the cards that are available for a poker player to use. This program will be expandable to use 5 card hands through 52 card hands! Suits of the cards are all equally ranked, so they only matter for determination of flushes (and straight flushes).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For each challenge, you should feel free to reuse your solutions from prior challenges in the series. To break this problem into smaller pieces, I am likely making architectural choices that are sub-optimal for speed. This is being done as an exercise in coding. The larger goal of this project can likely be done in a much faster, but more obscure way.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>--------</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A full house is three cards of one rank (column) and two cards of a different rank. The Ace (first column) is the highest rank. The columns represent A, 2, 3, ... K. When there is a choice between two possible three of a kind, choose the higher. Once a three of a kind is choosen, choose the highest possible pair.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This hand matrix:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[0 1 0 0 0 0 0 1 0 0 0 0 0 \n0 0 0 0 0 0 0 0 0 0 0 0 0\n0 1 0 0 0 0 0 0 0 0 0 0 0 \n0 1 0 0 0 0 0 1 0 0 0 0 0]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>represents a full house, so the return value from the function is TRUE.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This hand matrix does not:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[0 1 1 0 1 0 0 0 0 0 0 0 0 \n0 0 0 1 0 0 0 0 0 0 0 0 0\n0 0 0 1 0 0 0 0 0 0 0 0 0 \n0 0 0 1 0 0 0 0 0 0 0 0 0]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>so the return value should be FALSE.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This hand matrix does represent a full house</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1 0 1 0 0 0 0 0 0 0 1 0 1 \n0 0 1 0 0 1 0 0 0 0 0 0 0\n0 0 1 0 0 0 0 0 0 0 0 0 0 \n0 0 0 0 0 1 0 0 0 0 0 0 0]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Remember, hand matrices can contain any number of 1's from 0 to 52.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[0 1 1 0 1 1 0 0 0 0 0 0 0 \n0 0 0 0 1 0 1 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 \n0 0 1 0 0 0 0 0 0 0 0 0 0]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Would be FALSE for this function.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>A second output argument should come from this function. It is a usedCards Matrix. It is of the same form as the hand Matrix, but it only shows the cards used to make the full house. If more than one full house can be made, return the higher ranking one (the one with the highest ranking three of a kind. Ace being the highest. Ties are broken with the highest ranking pair). If different suits are possible for the same full house, return the ones higher up in the matrix.</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>"}]}

The Poker Series consists of many short, well defined functions that when combined will lead to complex behavior. Our goal is to create a function that will take two hand matrices (defined below) and return the winning hand.A hand matrix is 4x13 binary matrix showing the cards that are available for a poker player to use. This program will be expandable to use 5 card hands through 52 card hands! Suits of the cards are all equally ranked, so they only matter for determination of flushes (and straight flushes).For each challenge, you should feel free to reuse your solutions from prior challenges in the series. To break this problem into smaller pieces, I am likely making architectural choices that are sub-optimal for speed. This is being done as an exercise in coding. The larger goal of this project can likely be done in a much faster, but more obscure way.--------A full house is three cards of one rank (column) and two cards of a different rank. The Ace (first column) is the highest rank. The columns represent A, 2, 3, ... K. When there is a choice between two possible three of a kind, choose the higher. Once a three of a kind is choosen, choose the highest possible pair.This hand matrix:<pre class="language-matlab">0 1 0 0 0 0 0 1 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 0 0 0 
0 1 0 0 0 0 0 1 0 0 0 0 0
</pre>represents a full house, so the return value from the function is TRUE.This hand matrix does not:<pre class="language-matlab">0 1 1 0 1 0 0 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 0 0 0 0 0 0 
0 0 0 1 0 0 0 0 0 0 0 0 0
</pre>so the return value should be FALSE.This hand matrix does represent a full house<pre class="language-matlab">1 0 1 0 0 0 0 0 0 0 1 0 1 
0 0 1 0 0 1 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 1 0 0 0 0 0 0 0
</pre>Remember, hand matrices can contain any number of 1's from 0 to 52.<pre class="language-matlab">0 1 1 0 1 1 0 0 0 0 0 0 0 
0 0 0 0 1 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 
0 0 1 0 0 0 0 0 0 0 0 0 0 
</pre>Would be FALSE for this function.A second output argument should come from this function. It is a usedCards Matrix. It is of the same form as the hand Matrix, but it only shows the cards used to make the full house. If more than one full house can be made, return the higher ranking one (the one with the highest ranking three of a kind. Ace being the highest. Ties are broken with the highest ranking pair). If different suits are possible for the same full house, return the ones higher up in the matrix.

The Poker Series consists of many short, well defined functions that when combined will lead to complex behavior.  Our goal is to create a function that will take two hand matrices (defined below) and return the winning hand.

A hand matrix is 4x13 binary matrix showing the cards that are available for a poker player to use.  This program will be expandable to use 5 card hands through 52 card hands!  Suits of the cards are all equally ranked, so they only matter for determination of flushes (and straight flushes).

For each challenge, you should feel free to reuse your solutions from prior challenges in the series.  To break this problem into smaller pieces, I am likely making architectural choices that are sub-optimal for speed.  This is being done as an exercise in coding.  The larger goal of this project can likely be done in a much faster, but more obscure way.

--------

A full house is three cards of one rank (column) and two cards of a different rank.  The Ace (first column) is the highest rank.  The columns represent A, 2, 3, ... K.  When there is a choice between two possible three of a kind, choose the higher.  Once a three of a kind is choosen, choose the highest possible pair.

This hand matrix:

0 1 0 0 0 0 0 1 0 0 0 0 0 
  0 0 0 0 0 0 0 0 0 0 0 0 0
  0 1 0 0 0 0 0 0 0 0 0 0 0 
  0 1 0 0 0 0 0 1 0 0 0 0 0

represents a full house, so the return value from the function is TRUE.

This hand matrix does not:

0 1 1 0 1 0 0 0 0 0 0 0 0 
  0 0 0 1 0 0 0 0 0 0 0 0 0
  0 0 0 1 0 0 0 0 0 0 0 0 0 
  0 0 0 1 0 0 0 0 0 0 0 0 0

so the return value should be FALSE.

This hand matrix does represent a full house

1 0 1 0 0 0 0 0 0 0 1 0 1 
  0 0 1 0 0 1 0 0 0 0 0 0 0
  0 0 1 0 0 0 0 0 0 0 0 0 0 
  0 0 0 0 0 1 0 0 0 0 0 0 0

Remember, hand matrices can contain any number of 1's from 0 to 52.

0 1 1 0 1 1 0 0 0 0 0 0 0 
  0 0 0 0 1 0 1 0 0 0 0 0 0
  0 0 0 0 0 0 0 0 0 0 0 0 0 
  0 0 1 0 0 0 0 0 0 0 0 0 0

Would be FALSE for this function.

A second output argument should come from this function.  It is a usedCards Matrix.  It is of the same form as the hand Matrix, but it only shows the cards used to make the full house.  If more than one full house can be made, return the higher ranking one (the one with the highest ranking three of a kind.  Ace being the highest.  Ties are broken with the highest ranking pair).  If different suits are possible for the same full house, return the ones higher up in the matrix.

Solve

Solution Stats

213 Solutions
67 Solvers

Last Solution submitted on Oct 30, 2022

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Rafael S.T. Vieira on 13 Sep 2020

This problem needs more test cases with the three of a kind appearing before the pair, such as:
1 0 1 0 0 0 0 0 0 0 1 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 0 0 0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 0 0 0 1 0 0

Problem Recent Solvers67

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 334. Poker Series 03: isFullHouse

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers67

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Problem 334. Poker Series 03: isFullHouse

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers67

Suggested Problems

More from this Author51

Problem Tags

Community Treasure Hunt

Players