Coach or Kasparov

May 1, 2015 in Mathematics

To encourage John’s promising chess career, his coach offers him a prize if he wins (at least) two games in a row in a three-game series to be played with his coach and Garry Kasparov alternately: coach-kasparov-coach or kasparov-coach-kasparov, according to John’s choice. Kasparov is (evidently) a better player than John’s coach. Which series should John choose? 1

Let be the probability of winning the coach and the probability of winning Kasparov, where . The winning outcomes for the first scenario (C-K-C) are:

outcome probability
$C_0K_1C_1$ $p_C~p_K~(1-p_C)$
$C_1K_1C_0$ $p_C~p_K~(1-p_C)$
$C_1K_1C_1$ $p_C~p_K~p_C$

And thus $p_C~p_K~(1-p_C) + p_C~p_K~(1-p_C) + p_C~p_K~p_C = p_K~p_C~(2 - p_C)$. For the second scenario (K-C-K):

outcome probability
$K_0C_1K_1$ $p_K~p_C~(1-p_K)$
$K_1C_1K_0$ $p_K~p_C~(1-p_K)$
$K_1C_1K_1$ $p_K~p_C~p_K$

Where $p_K~p_C~(1-p_K) + p_K~p_C~(1-p_K) + p_K~p_K~p_C = p_K~p_C~(2 - p_K)$. Hence:

  1. This is adapted from problem 2 of Frederick Mosteller’s “Fifty Challenging Problems in Probability”. ↩︎

who am i

I am a Software Engineer and aspiring Computer Science theorist. My ultimate goal is to develop AI algorithms with some provable guarantees.

what is this

This is a blog about computer science theory, some mathematics, and the AI. I put here all my thoughts that are not publication-ready.

© MMXVI — MMXVII by Uros Nedic.
Content available under Creative Commons (BY-NC-SA) unless otherwise noted.