Skip to main content
Puzzling

Return to Question

replaced http://puzzling.stackexchange.com/ with https://puzzling.stackexchange.com/
Source Link
Community Bot
Community Bot
  • 1

This is a follow-up to "http"https://puzzling.stackexchange.com/questions/23150/how-to-beat-count-dracula" and to "http"https://puzzling.stackexchange.com/questions/33430/how-to-beat-count-dracula-part-2".

Abraham Van Helsing and Jonathan Harker play a game against Count Dracula. The three players agree on the following rules:

  1. Count Dracula and Van Helsing enter the crypt, while Jonathan Harker has to wait outside. The crypt contains five coffins that are respectively numbered $1,\ldots,5$, together with five golden lockets that are respectively engraved with the numbers $1,\ldots,5$.
  1. Count Dracula puts the lockets into the coffins, so that every coffin contains exactly one locket. Every possible assignment of the five lockets is used with equal probability. (That's important: the count does not pick the assignment.) Van Helsing observes this, and knows exactly which locket is in which coffin.
  1. Now it is Van Helsing's turn: Van Helsing may (but does not have to) pick a pair of coffins and switch the lockets in these two coffins.
  1. Van Helsing now leaves the crypt through the back door. Jonathan Harker (who has gained no additional knowledge over the choices of Dracula and Van Helsing in the first three steps) enters the crypt.
  1. Count Dracula uses a random generator to pick an integer $N$ with $1\le N\le5$, and announces $N$ to Jonathan. Every possible value for $N$ is picked with probability $1/5$.
  1. Jonathan is allowed to choose one coffin and to open it.
    • If Jonathan Harker finds the locket with number $N$ in the opened coffin, then he and Van Helsing have won the game. In this case, they are allowed to drive a wooden stake through Dracula's heart.
      * If Harker does not find the locket with number $N$, then Count Dracula is allowed to drink Van Helsing's and Harker's blood to the last remaining drop.

Harker and Van Helsing discuss their options and want to agree on a good strategy. If Harker chooses his coffins simply at random, then the team Harker & Van Helsing has a $1/5$ probability of winning the game. What is the best probability of success that Harker & Van Helsing can reach?

This is a follow-up to "http://puzzling.stackexchange.com/questions/23150/how-to-beat-count-dracula" and to "http://puzzling.stackexchange.com/questions/33430/how-to-beat-count-dracula-part-2".

Abraham Van Helsing and Jonathan Harker play a game against Count Dracula. The three players agree on the following rules:

  1. Count Dracula and Van Helsing enter the crypt, while Jonathan Harker has to wait outside. The crypt contains five coffins that are respectively numbered $1,\ldots,5$, together with five golden lockets that are respectively engraved with the numbers $1,\ldots,5$.
  1. Count Dracula puts the lockets into the coffins, so that every coffin contains exactly one locket. Every possible assignment of the five lockets is used with equal probability. (That's important: the count does not pick the assignment.) Van Helsing observes this, and knows exactly which locket is in which coffin.
  1. Now it is Van Helsing's turn: Van Helsing may (but does not have to) pick a pair of coffins and switch the lockets in these two coffins.
  1. Van Helsing now leaves the crypt through the back door. Jonathan Harker (who has gained no additional knowledge over the choices of Dracula and Van Helsing in the first three steps) enters the crypt.
  1. Count Dracula uses a random generator to pick an integer $N$ with $1\le N\le5$, and announces $N$ to Jonathan. Every possible value for $N$ is picked with probability $1/5$.
  1. Jonathan is allowed to choose one coffin and to open it.
    • If Jonathan Harker finds the locket with number $N$ in the opened coffin, then he and Van Helsing have won the game. In this case, they are allowed to drive a wooden stake through Dracula's heart.
      * If Harker does not find the locket with number $N$, then Count Dracula is allowed to drink Van Helsing's and Harker's blood to the last remaining drop.

Harker and Van Helsing discuss their options and want to agree on a good strategy. If Harker chooses his coffins simply at random, then the team Harker & Van Helsing has a $1/5$ probability of winning the game. What is the best probability of success that Harker & Van Helsing can reach?

This is a follow-up to "https://puzzling.stackexchange.com/questions/23150/how-to-beat-count-dracula" and to "https://puzzling.stackexchange.com/questions/33430/how-to-beat-count-dracula-part-2".

Abraham Van Helsing and Jonathan Harker play a game against Count Dracula. The three players agree on the following rules:

  1. Count Dracula and Van Helsing enter the crypt, while Jonathan Harker has to wait outside. The crypt contains five coffins that are respectively numbered $1,\ldots,5$, together with five golden lockets that are respectively engraved with the numbers $1,\ldots,5$.
  1. Count Dracula puts the lockets into the coffins, so that every coffin contains exactly one locket. Every possible assignment of the five lockets is used with equal probability. (That's important: the count does not pick the assignment.) Van Helsing observes this, and knows exactly which locket is in which coffin.
  1. Now it is Van Helsing's turn: Van Helsing may (but does not have to) pick a pair of coffins and switch the lockets in these two coffins.
  1. Van Helsing now leaves the crypt through the back door. Jonathan Harker (who has gained no additional knowledge over the choices of Dracula and Van Helsing in the first three steps) enters the crypt.
  1. Count Dracula uses a random generator to pick an integer $N$ with $1\le N\le5$, and announces $N$ to Jonathan. Every possible value for $N$ is picked with probability $1/5$.
  1. Jonathan is allowed to choose one coffin and to open it.
    • If Jonathan Harker finds the locket with number $N$ in the opened coffin, then he and Van Helsing have won the game. In this case, they are allowed to drive a wooden stake through Dracula's heart.
      * If Harker does not find the locket with number $N$, then Count Dracula is allowed to drink Van Helsing's and Harker's blood to the last remaining drop.

Harker and Van Helsing discuss their options and want to agree on a good strategy. If Harker chooses his coffins simply at random, then the team Harker & Van Helsing has a $1/5$ probability of winning the game. What is the best probability of success that Harker & Van Helsing can reach?

Source Link
Gamow
Gamow
  • 45.9k
  • 10
  • 151
  • 387

How to beat Count Dracula, part 3

This is a follow-up to "http://puzzling.stackexchange.com/questions/23150/how-to-beat-count-dracula" and to "http://puzzling.stackexchange.com/questions/33430/how-to-beat-count-dracula-part-2".

Abraham Van Helsing and Jonathan Harker play a game against Count Dracula. The three players agree on the following rules:

  1. Count Dracula and Van Helsing enter the crypt, while Jonathan Harker has to wait outside. The crypt contains five coffins that are respectively numbered $1,\ldots,5$, together with five golden lockets that are respectively engraved with the numbers $1,\ldots,5$.
  1. Count Dracula puts the lockets into the coffins, so that every coffin contains exactly one locket. Every possible assignment of the five lockets is used with equal probability. (That's important: the count does not pick the assignment.) Van Helsing observes this, and knows exactly which locket is in which coffin.
  1. Now it is Van Helsing's turn: Van Helsing may (but does not have to) pick a pair of coffins and switch the lockets in these two coffins.
  1. Van Helsing now leaves the crypt through the back door. Jonathan Harker (who has gained no additional knowledge over the choices of Dracula and Van Helsing in the first three steps) enters the crypt.
  1. Count Dracula uses a random generator to pick an integer $N$ with $1\le N\le5$, and announces $N$ to Jonathan. Every possible value for $N$ is picked with probability $1/5$.
  1. Jonathan is allowed to choose one coffin and to open it.
    • If Jonathan Harker finds the locket with number $N$ in the opened coffin, then he and Van Helsing have won the game. In this case, they are allowed to drive a wooden stake through Dracula's heart.
      * If Harker does not find the locket with number $N$, then Count Dracula is allowed to drink Van Helsing's and Harker's blood to the last remaining drop.

Harker and Van Helsing discuss their options and want to agree on a good strategy. If Harker chooses his coffins simply at random, then the team Harker & Van Helsing has a $1/5$ probability of winning the game. What is the best probability of success that Harker & Van Helsing can reach?