Skip to main content
Fixed typo; improved punctuation and formatting; tweaked wording.
Source Link
Peregrine Rook
  • 4.9k
  • 2
  • 26
  • 40

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and only block only one door at a time,time; however, you do not know which bolt currently is beforeblocking which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons A, B, C, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button A slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button B slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button C slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e., to move all the buttons in front ofbolts to one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and only block one door at a time, however you do not know which bolt currently is before which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons A, B, C, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button A slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button B slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button C slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e. to move all the buttons in front of one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and block only one door at a time; however, you do not know which bolt currently is blocking which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons A, B, C, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button A slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button B slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button C slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e., to move all the bolts to one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

Improve formatting
Source Link
GentlePurpleRain
  • 26.5k
  • 6
  • 95
  • 159

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and only block one door at a time, however you do not know which bolt currently is before which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons AA, BB, CC, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button AA slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button BB slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button CC slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e. to move all the buttons in front of one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and only block one door at a time, however you do not know which bolt currently is before which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons A, B, C, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button A slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button B slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button C slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e. to move all the buttons in front of one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

You are in a room with two adjacent doors locked by four sliding bolts. The bolts are movable and only block one door at a time, however you do not know which bolt currently is before which door.

An example configuration:

two doors blocked by four sliding bolts (example configuration)

Luckily, there are three buttons A, B, C, which cause some bolts to slide from the door they are curently blocking over to the other door. However, each button can trigger different actions, which one is used is determined at each push in a fully random way:

  • Button A slides at random either
  • bolt 1 or
  • bolt 2 or
  • bolt 3 or
  • bolt 4.
  • Button B slides at random either
  • bolt 1 and 2 or
  • bolt 2 and 3 or
  • bolt 3 and 4 or
  • bolt 4 and 1.
  • Button C slides at random either
  • bolt 1 and 3 or
  • bolt 2 and 4.

Your task is to find a sequence of button activations to get out of the room (i.e. to move all the buttons in front of one door so the other one is open) regardless of the unknown initial position of the bolts. (You may try the doors after each touch of a button to see whether they are open.) The sequence should be as short as possible.

Source: Newsgroup de.rec.denksport, Zwei Tueren, vier Riegel, GJ Woeginger, 2011-10-15 (German)

edited tags
Link
diabonas
  • 998
  • 9
  • 16
Assuming the answer is known and this puzzle is presented as a challenge to us.
Link
Loading
clarified randomness of button actions; clarified sucessful solution
Source Link
diabonas
  • 998
  • 9
  • 16
Loading
Source Link
diabonas
  • 998
  • 9
  • 16
Loading