Problem 335. Poker Series 04: isFlush
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 suboptimal 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 flush is 5 cards of the same suit (row). If there are more than five cards in a suit to choose from, the highest five count. The Ace (first column) is the highest. The columns represent A, 2, 3, ... K.
This hand matrix:
0 1 1 0 1 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
represents a flush, so the return value from the function is TRUE.
This hand matrix does not:
0 1 1 0 1 1 0 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 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
so the return value should be FALSE.
This hand matrix does represent a flush
1 0 0 0 0 0 0 0 0 1 1 1 1 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 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 flush. If more than one flush can be made, return the higher ranking one (the one with the highest top card. Ace being the highest ties broken by the second, third, fourth, and then fifth card). If different suits are possible for the same flush, return the one higher up in the matrix. If the flush happens to also be a straight flush, it still meets the defintion and should be returned. The highest flush should be returned, even if a straight flush can also be made.
Solution Stats
Problem Comments

1 Comment
The order of this series is completely inversed. The functions isPair and IsTreeKind should have been used to build the function isFlush for instance. Moreover, the function isQuads should have used the function isTwoPair and the function isTwoPair should have used the function isPair (and I could go on).
Solution Comments
Show commentsProblem Recent Solvers67
Suggested Problems

1427 Solvers

171 Solvers

Find best placement for ordered dominoes (harder)
309 Solvers

Sum the entries of each column of a matrix which satisfy a logical condition.
157 Solvers

222 Solvers
More from this Author51
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!