Problem 43969. Sleeping Queens 1

Created by James

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>My youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You are dealt five cards, most of which have numbers 1-10 on them. There are other cards, but for now we will just deal with the numbers. You can discard cards in any of three different methods and draw that many new cards:</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>Individual cards, one at a time</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>Pairs of cards, but not three or four of a kind</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>Cards that make up an addition problem.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Write a MATLAB script that will tell you how how many different ways you can discard cards in your hand.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For example, if your hand had the cards [1 2 2 4 9], you could discard</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 of the cards individually (5)</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>The pair of 2s (1)</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>[2 2 4] because 2+2=4 (1)</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 2 2 4 9] because 1+2+2+4=9 (1)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>so your script would output 8. Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:</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 of the cards individually (5)</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 of the three different pairs of 2s (3)</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>[2 2 2 6] because 2+2+2=6 (1)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>So the output of your script for [1 2 2 2 6] should be 9. We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are. Good luck, and happy hunting!</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>"}]}

My youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.You are dealt five cards, most of which have numbers 1-10 on them. There are other cards, but for now we will just deal with the numbers. You can discard cards in any of three different methods and draw that many new cards:<ul><li>Individual cards, one at a time</li><li>Pairs of cards, but not three or four of a kind</li><li>Cards that make up an addition problem.</li></ul>Write a MATLAB script that will tell you how how many different ways you can discard cards in your hand.For example, if your hand had the cards [1 2 2 4 9], you could discard<ul><li>Any of the cards individually (5)</li><li>The pair of 2s (1)</li><li>[2 2 4] because 2+2=4 (1)</li><li>[1 2 2 4 9] because 1+2+2+4=9 (1)</li></ul>so your script would output 8. Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:<ul><li>Any of the cards individually (5)</li><li>Any of the three different pairs of 2s (3)</li><li>[2 2 2 6] because 2+2+2=6 (1)</li></ul>So the output of your script for [1 2 2 2 6] should be 9. We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are. Good luck, and happy hunting!

My youngest daughter received a card game named Sleeping Queens for Christmas this year, and has been playing it nearly non-stop since opening it.

You are dealt five cards, most of which have numbers 1-10 on them.  There are other cards, but for now we will just deal with the numbers.  You can discard cards in any of three different methods and draw that many new cards:

* Individual cards, one at a time
* Pairs of cards, but not three or four of a kind
* Cards that make up an addition problem.

Write a MATLAB script that will tell you how how many different ways you can discard cards in your hand.

For example, if your hand had the cards [1 2 2 4 9], you could discard

* Any of the cards individually  (5)
* The pair of 2s  (1)
* [2 2 4] because 2+2=4  (1)
* [1 2 2 4 9] because 1+2+2+4=9  (1)

so your script would output 8.  Likewise, a hand of [1 2 2 2 6] would allow you discard cards 9 different ways:

* Any of the cards individually  (5)
* Any of the three different pairs of 2s  (3)
* [2 2 2 6] because 2+2+2=6  (1)

So the output of your script for [1 2 2 2 6] should be 9.  We don't need to know what the possible combinations are to discard just yet; we just need to know how many there are.  Good luck, and happy hunting!

Solve

Solution Stats

39 Solutions
17 Solvers

Last Solution submitted on Feb 27, 2023

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Jean-Marie Sainthillier on 4 Jan 2017

Good problem

Rafael S.T. Vieira on 22 Jul 2020

Wouldn't [2 2 2 6] make a three of a kind?

Solution Comments

Show comments

Problem Recent Solvers17

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 43969. Sleeping Queens 1

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Problem 43969. Sleeping Queens 1

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers17

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Players