In this weeks installment of Matt solves a riddle with a simulation, we have the ridder express question from fivethirtyeight. In a chess match, 12 games are played and the first player to 6.5 points wins. You get 1 point for a win, 0.5 points for a draw, and 0 for a loss. It’s very possible that the best player loses a chess match with this scoring system and only twelve games. It’s more than football, baseball, or basketball, but is 12 games enough to decide? Furthermore, how many games would be required to determine the winner 90% or 99% of the time.
Continue reading “How Often Does the Best Chess Player Win?” →
The 538 Riddler question this week isn’t especially interesting. What are the chances that somebody’s phone number has the exact same seven digits as your phone number, just in a different order? But as I was driving home thinking about it, I realized that there were several different ways to go about this and I wondered which was faster.
Continue reading “Two Phone Numbers With The Same Digits?” →
I recently came across an interesting math problem on youtube (why youtube keeps showing me these when I’m watching cooking shows, I’ll never understand, but I digress). What is the average distance between two random points on a circle? This can also be expanded to ask what is the average distance between two random points inside a circle? Now of course I’m not going to sit down and do lots of math to figure this out, but it is a kinda interesting problem for a monte carlo simulation. So I dusted the python off and went to work.
Continue reading “Average Distance Between Points On or In a Circle” →
About a year ago one of my friends introduced me to the online trivia LearnedLeague (LL for short). You have to be invited by a current member but then you are assigned a “rundle” or group of people about your level to play against and answer trivia, etc, etc. We not have 8 different friends playing and have a groupme chat going to discuss answers each day (after submitting of course). But it got kinda annoying to log in to LL each morning and navigate to the four different rundles we’re in to see the results or compare us amongst ourselves. So I used my web scraping and python to do it for me!
Continue reading “Web Scrapping LearnedLeague with Python” →
Nate Silver (of 538 fame) tweeted an interesting problem today. Somebody on Reddit had averaged the birthdays of all the presidents and found it to be July 4th (link). Nate responded that it was wrong and said the real average is sometime in late November. I thought it was an interesting problem and figured I’d work on my python skills so I decided to see for myself and threw in a couple of alterations as well.
Continue reading “Average President’s Birthday” →
Have you heard of Fizz Buzz? It’s commonly used as an basic software interview question or an intro programming example. It’s based on a game meant to teach children division and goes like this. The children sit in a circle and count up from one; but, if your number is divisible by 3 you say “Fizz” instead of your number and if your number is divisible by 5 you say “Buzz” instead of your number. If your number is divisible by both 3 and 5 you say “Fizz Buzz”.
Continue reading “Fizz Buzz – The Easiest Interview Question” →
Many of you are familiar with the Birthday Paradox. If you want to read more about it you can find a good article here. Basically, it says that in a room of 23 people, there is a 50% chance that at least two people share a birthday. And if you increase that number to 75 people, the chances go up to 99.9%. I wanted to explore this a little more and rather than doing the math (boring!), I decided to do a Monte Carlo simulation, run it a bunch of times, and plot the results.
Continue reading “Birthday Paradox Monte Carlo Simulation” →
I’m working to bone up on my python skills so I decided to spend my Sunday doing problems 1-10 from Project Euler. I’ve done them before with C or Java but this was my first time with Python. Here are the problems and my commented code for each one in case it interests anybody.
Continue reading “Project Euler Problems 1-10 in Python” →
Here’s my solution to this week’s Riddler Classic puzzle FiveThirtyEight. Here’s the question: ” You are the only sane voter in a state with two candidates running for Senate. There are N other people in the state, and each of them votes completely randomly! Those voters all act independently and have a 50-50 chance of voting for either candidate. What are the odds that your vote changes the outcome of the election toward your preferred candidate? More importantly, how do these odds scale with the number of people in the state? For example, if twice as many people lived in the state, how much would your chances of swinging the election change?”
Continue reading “Riddler Classic – 11-4-2016 – Will You Decide the Election?” →
Here’s my solution to this week’s Riddler Express question from FiveThirtyEight. Here’s the question: “You place 100 coins heads up in a row and number them by position, with the coin all the way on the left No. 1 and the one on the rightmost edge No. 100. Next, for every number N, from 1 to 100, you flip over every coin whose position is a multiple of N. For example, first you’ll flip over all the coins, because every number is a multiple of 1. Then you’ll flip over all the even-numbered coins, because they’re multiples of 2. Then you’ll flip coins No. 3, 6, 9, 12 … And so on. What do the coins look like when you’re done? Specifically, which coins are heads down?”
Continue reading “Riddler Express – 10-14-16 – Turning Coins Over” →