Consider a form of solitaire, 'sometimes called “frustration solitaire.” In this particular game, a deck of cards is shuffled, and then dealt out, one card at a time. As the cards are being dealt, the player counts from 1 to 13, and then starts again at 1. (Thus, each number is counted four times.) If a number that is being counted coincides with the rank of the card that is being turned up, then the player loses the game.' (from https://www.dartmouth.edu/~chance/teaching_aids/books_articles/probability_book/Chapter3.pdf Combinatorics, Dartmouth]
Why is figuring out the odds of losing this game not as straightforward as it might at first appear?
Course tags: | Computational Thinking | Human Centered Design | 'Required' Purchase | Recommended Purchase | Request for Library |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Robots and AI | Blockchain | Automation and Control | Seeing Machines | Recognizing Patterns | Flow, Decisions, and Modularity | Spare Session | Wrap Up | Languages | Machines | Sorting and Searching | Pointers, Trees, and Graphs | Information Jigs | Solving Problems with Finesse | Solving Problems with Iteration (aka Pattern Generation) | Counting and Probability | Logic and Boolean Algebra | Welcome and Course Intro |
Go to Course: Computational Thinking | Human Centered Design
Post preview:
Close preview