Problem 1512. Clock Solitaire

Created by Nicholas Howe

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>Many card players will be familiar with the game of </w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Clock_patience\"><w:r><w:t>Clock Solitaire</w:t></w:r></w:hyperlink><w:r><w:t>. Briefly, the player sets up by creating thirteen piles of four face-down cards at random, each associated with one of the ranks ace through king. Beginning with the top card in the king's pile, the player places the drawn card face up beneath its home pile, and draws a new card from the top of that same pile. Play continues until the fourth king is drawn. If all cards are face up in their home piles at this time, the game is a winner.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Since clock solitaire is a purely deterministic game, a computer can easily be programmed to play. For this problem, you will write a function that takes a deck and reports whether or not it is a winning configuration. More specifically, the input will be some permutation of the integers 1:52, where 1:13 represent the ace through king of clubs, 14:26 the ace through king of diamonds, 27:39 the hearts, and 40:52 the spades. Assume that the cards are formed into 13 piles by taking the first four cards as the ace pile, next four as the deuce pile, etc. Output is a single scalar boolean indicating whether the game will be won using this deck.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Armed with this function, one can determine empirically what the win rate is for randomly shuffled decks. See if you can find out!</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>"}]}

Many card players will be familiar with the game of <a href = "http://en.wikipedia.org/wiki/Clock_patience">Clock Solitaire</a>. Briefly, the player sets up by creating thirteen piles of four face-down cards at random, each associated with one of the ranks ace through king. Beginning with the top card in the king's pile, the player places the drawn card face up beneath its home pile, and draws a new card from the top of that same pile. Play continues until the fourth king is drawn. If all cards are face up in their home piles at this time, the game is a winner.Since clock solitaire is a purely deterministic game, a computer can easily be programmed to play. For this problem, you will write a function that takes a deck and reports whether or not it is a winning configuration. More specifically, the input will be some permutation of the integers 1:52, where 1:13 represent the ace through king of clubs, 14:26 the ace through king of diamonds, 27:39 the hearts, and 40:52 the spades. Assume that the cards are formed into 13 piles by taking the first four cards as the ace pile, next four as the deuce pile, etc. Output is a single scalar boolean indicating whether the game will be won using this deck.Armed with this function, one can determine empirically what the win rate is for randomly shuffled decks. See if you can find out!

Solve

Solution Stats

107 Solutions
34 Solvers

Last Solution submitted on Feb 10, 2021

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Richard Zapor on 14 May 2017

Please add a test case that kills my invalid leading solution.
I misinterpreted the wiki page for sequencing which I thought was random choice to produce a 1 in 13 probability.

Solution Comments

Solution 1203389

1 Comment

1 Comment

yurenchu on 2 Jun 2017

Weird that this works. (The fourth line is incorrect, by mistake; I had forgotten to change it after I discovered that the top card of each pile is the left-most of each group of four, not the right-most. Yet it works.)

Problem Recent Solvers34

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 1512. Clock Solitaire

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers34

Suggested Problems

More from this Author11

Problem Tags

Community Treasure Hunt

Problem 1512. Clock Solitaire

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers34

Suggested Problems

More from this Author11

Problem Tags

Community Treasure Hunt

Players