TY - CHAP
T1 - Make Puzzles Great Again
AU - Aristizabal, Nicolás
AU - Pinzón, Carlos
AU - Rueda, Camilo
AU - Valencia, Frank
N1 - Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - We present original solutions to four challenging mathematical puzzles. The first two are concerned with random processes. The first, here called The President’s Welfare Plan, can be reduced to computing, for arbitrary large values of n, the expected number of iterations of a program that increases a variable at random between 1 and n until exceeds n. The second one, called The Dining Researchers, can be reduced to determining the probability of reaching a given point after visiting all the others in a circular random walk. The other two problems, called Students vs Professor and Students vs Professor II, involve finding optimal winning group strategies in guessing games.
AB - We present original solutions to four challenging mathematical puzzles. The first two are concerned with random processes. The first, here called The President’s Welfare Plan, can be reduced to computing, for arbitrary large values of n, the expected number of iterations of a program that increases a variable at random between 1 and n until exceeds n. The second one, called The Dining Researchers, can be reduced to determining the probability of reaching a given point after visiting all the others in a circular random walk. The other two problems, called Students vs Professor and Students vs Professor II, involve finding optimal winning group strategies in guessing games.
U2 - 10.1007/978-3-030-31175-9_25
DO - 10.1007/978-3-030-31175-9_25
M3 - Chapter
AN - SCOPUS:85075071510
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 442
EP - 459
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PB - Springer Verlag
ER -