Make Puzzles Great Again

Nicolás Aristizabal; Carlos Pinzón; Camilo Rueda; Frank Valencia

doi:10.1007/978-3-030-31175-9_25

Make Puzzles Great Again

Nicolás Aristizabal, Carlos Pinzón, Camilo Rueda, Frank Valencia

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

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.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer Verlag
Pages	442-459
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-030-31175-9_25
State	Published - 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11760 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-030-31175-9_25

Cite this

Aristizabal, N., Pinzón, C., Rueda, C., & Valencia, F. (2019). Make Puzzles Great Again. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 442-459). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11760 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-31175-9_25

Aristizabal, Nicolás ; Pinzón, Carlos ; Rueda, Camilo et al. / Make Puzzles Great Again. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, 2019. pp. 442-459 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{07d45ed1d1be4e14bc9e29ae62dfd451,

title = "Make Puzzles Great Again",

abstract = "We present original solutions to four challenging mathematical puzzles. The first two are concerned with random processes. The first, here called The President{\textquoteright}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.",

author = "Nicol{\'a}s Aristizabal and Carlos Pinz{\'o}n and Camilo Rueda and Frank Valencia",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.",

year = "2019",

doi = "10.1007/978-3-030-31175-9_25",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "442--459",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Aristizabal, N, Pinzón, C, Rueda, C & Valencia, F 2019, Make Puzzles Great Again. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11760 LNCS, Springer Verlag, pp. 442-459. https://doi.org/10.1007/978-3-030-31175-9_25

Make Puzzles Great Again. / Aristizabal, Nicolás; Pinzón, Carlos; Rueda, Camilo et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, 2019. p. 442-459 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11760 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Make Puzzles Great Again

AU - Aristizabal, Nicolás

AU - Pinzón, Carlos

AU - Rueda, Camilo

AU - Valencia, Frank

PY - 2019

Y1 - 2019

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.

UR - http://www.scopus.com/inward/record.url?scp=85075071510&partnerID=8YFLogxK

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 -

Aristizabal N, Pinzón C, Rueda C, Valencia F. Make Puzzles Great Again. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2019. p. 442-459. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-31175-9_25

Make Puzzles Great Again

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this