Logical puzzle, TASK:
In this brain teaser you are given a deck of N cards with numbers, and your task is to find the card with the lowest number. You can remove and take a look at only one card at a time. You may think it is similar to finding the lowest number in the array, but there is a trick: you are allowed to claim a card to be the lowest only when you are looking at it: if you decide to go to the next card, you won’t be allowed to choose any of the previous cards. For example, if the you are given cards with numbers -1, 1, 2, 3, 4, 5, then -1 is the lowest number, but when you look at -1, you don’t see the rest of the cards, and it’s possible that there will be -2 or -10 some time later. However, if after looking at -1, you decide to go further, then in this case you will definitely lose as -1 is the lowest number.
Obviously, there is no way to guarantee 100% success in this problem, so your task is to develop a strategy which would give the biggest probability of winning in this game.
This video is for all of you out there who are passionate about Math, Computer Science and logical thinking in general!
If you are one of my students, you can solve it and get 3% extra credit. Make sure to come to me after class, explain your solution and be able to answer additional questions.
If you just want to have fun and solve it, send me an email with your solution (srubinATfmarion.edu)
FMU website - fmarion.edu
FMU Computer Science website - fmarion.edu/computerscience/