From c260cbc87dabf0c21a501b2b2673ca5456536fe8 Mon Sep 17 00:00:00 2001 From: Peter Norvig Date: Mon, 28 Aug 2017 22:51:40 -0700 Subject: [PATCH] Add files via upload --- Coin Flip.ipynb | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Coin Flip.ipynb b/Coin Flip.ipynb index dcc5fff..120447b 100644 --- a/Coin Flip.ipynb +++ b/Coin Flip.ipynb @@ -337,7 +337,7 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "That's a 15-move sequence that is guaranteed to lead to a win. Do I believe it? It does appear to work. A colleague did the puzzle and got the same answer. And here's further validation: The function `random_play` takes a sequence of moves and plays it against a devil that chooses randomly:" + "That's a 15-move sequence that is guaranteed to lead to a win. Do I believe it? It does appear to work. A colleague did the puzzle and got the same answer. And here's further validation: The function `random_devil` takes a sequence of moves and plays those moves with a devil that chooses randomly:" ] }, { @@ -409,8 +409,8 @@ "cell_type": "markdown", "metadata": {}, "source": [ - "This says that the player always wins. If the player ever lost, there would be an entry for `None` in the Counter.\n", - "The remarkable thing, which I can't explain, is that the number of moves taken to win is so evenly distributed: very nearly 1,000 times for each of the numbers from 0 to 15 moves. Can you explain that?" + "This says that the player won all 16,000 times. If the player ever lost, there would be an entry for `None` in the Counter.\n", + "The remarkable thing, which I can't explain, is that there are very nearly 1,000 results for each of the counts from 0 to 15. Can you explain that?" ] } ],