Can You Find The Perfect Poker Hand? Can You Shut This Infernal Box?

Welcome to The Riddler. Every week, I offer up problems related to the things we hold dear around here: math, logic and probability. There are two types: Riddler Express for those of you who want something bite-size and Riddler Classic for those of you in the slow-puzzle movement. Submit a correct answer for either,1 and you may get a shoutout in next week’s column. If you need a hint or have a favorite puzzle collecting dust in your attic, find me on Twitter.

## Riddler Express

From Witold Wdziekonski, shuffle up and deal:

You are playing a standard game of Texas Hold ’em, in which you start with two cards. Five community cards will be dealt, and the object is to make the best five-card hand out of the seven cards available to you. However, you’re a perfectionist, and you’re only interested in making the best possible hand once the board has been dealt — such a hand is called the “nuts.”

Which two-card starting hand is the most likely to make the nuts once the board has been dealt?

## Riddler Classic

From Zack Segel, we’ll stay at the gambling table for a dice-rolling probability puzzle:

Shut the Box is a traditional pub game played with dice and a special box. The rules are as follows: The game’s box features nine tiles bearing the numbers 1 through 9. Those tiles rest on flippable levers, all of which begin the game “open.” To start the game, you roll two standard dice. You can then “shut” any combination of number tiles that add up to the total of your dice. For example, if you roll 8, you could shut the 8; or the 1 and 7; or the 1, 3 and 4; and so on. Once a number is shut, it stays shut. After you’ve shut your chosen numbers, you roll again and repeat the process. (During the game, once the 7, 8 and 9 are shut, you may choose whether to roll one die or two dice. If any of those numbers are still open, you must roll two dice.)

You win if you close all of the numbers before you run out of legal moves — that is, if you can’t shut numbers that add up to your dice count. If you play perfectly, what are your odds of successfully “shutting the box”?

## Solution to last week’s Riddler Express

Congratulations to 👏 Matthew Bishop 👏 of Orlando, Florida, winner of last week’s Riddler Express!

Last week, terror loomed. The year was 2000, and an arithmetical anarchist group had an idea. For the next 100 years, it would vandalize a famous landmark whenever the last two digits of the year (for example, this year is “18”) was the product of the month and date (i.e. when month × date = year, in the MM/DD/YY format). How many attacks will happen between the beginning of 2001 and the end of 2099? What year will see the most vandalism? The least? What will be the longest gap between attacks?

There will be 212 attacks during the century. The year 2024 will see the most vandalism, with seven attacks. Several years will see no vandalism. The longest gap between attacks will be 1,096 days.

There’s no real trick to this problem — it’s just a matter of carefully accounting the anarchic century ahead. A computer probably came in handy. Nick Holt solved the problem in R; Mark Fischer in Python; and William Stefanko in a Google spreadsheet.

But there is some intuitiveness to the answers. The year 2024 is especially dangerous because the number 24 has so many factors: 1, 2, 3, 4, 6, 8, 12 and 24. This yields lots of valid date-and-month combinations that multiply to the year 24: 1/24, 2/12, 3/8, 4/6, 6/4, 8/3 and 12/2. For the same reason, years like 2012, 2020 and 2036, with a lot of factors of their own, are also dangerous. The years with no attacks are larger prime-number years, such as 2037. Prime numbers have no factors other than 1 and themselves, and dates never get any bigger than 31, so the anarchists’ multiplication problem will never be satisfied in those years.

Solver Hernando Cortina plotted the frequency of vandalism attacks by year, showing how all this shakes out, in technicolor:

Be careful out there, Riddler Nation.

## Solution to last week’s Riddler Classic

Congratulations to 👏 Tiago Batalhão 👏 of Singapore, winner of last week’s Riddler Classic!

Early last week, Villanova won the men’s college basketball national title. The few teams that beat Villanova this season — Butler, St. John’s, Providence and Creighton — can therefore claim the dubious title of “transitive national champion.” And so too could the teams that beat those teams, and the teams that beat the teams that beat those teams, and so on. How many transitive national champions were there this season? Or, maybe more descriptively, how many teams weren’t transitive national champions?

Of the teams that played in the thousands of basketball games listed here, 1,185 (including Villanova) could claim a transitive title. Only a relatively few — 177 teams — could not.

The chains of wins required to justify the claims to a transitive title ranged from zero (Villanova itself) to 13. Congratulations to, among hundreds of other teams, the Albany College of Pharmacy and Health Sciences: your 2017-18 transitive national champs! That school beat Alfred State, which beat John Jay, which beat Elmira, which beat Oswego, which beat SUNY Oneonta, which beat Roanoke, which beat Lynchburg, which beat Norfolk State, which beat Stony Brook, which beat Rutgers, which beat Seton Hall, which beat Butler, which beat Villanova! Phew.

Solver Jason Ash plotted the degrees of separation from the actual champion, Villanova, to the broader field of teams. The most common length of a chain to a transitive championship was nine:

The games included in the analyses above include some teams not even in the highest echelons of college basketball — that is, not in NCAA Division I and, in some cases, not in the NCAA at all. Ferris State, for example, plays in Division II, and Albany Pharmacy plays in the USCAA. But when we focus just on the highest tier, we find something even more surprising (to me, anyway): Every single Division I men’s basketball program — all 351 of them — could rightfully claim a transitive national championship this season. That’s a lot of nets that need cutting down.

Solver Allen Jarvis mapped the intricate web of D-I college basketball, from Villanova on the far left to teams with longer strings needed, including Houston Baptist, Eastern Kentucky and Savannah State, on the far right. (The arrows point to the team that beat the connected team.) This graph is fully connected, implying that every school could have claimed a transitive title regardless of who the real champion wound up being.

Congratulations to … everyone!

## Want to submit a riddle?

Email me at oliver.roeder@fivethirtyeight.com.

## Footnotes

1. Important small print: For you to be eligible, I need to receive your correct answer before 11:59 p.m. Eastern time on Sunday. Have a great weekend!

Oliver Roeder is a senior writer for FiveThirtyEight.

Filed under