This puzzle was invented by Oskar van Deventer, and made by Recent Toys. It consists of a hinged box, of which the lid is a frame containing 7 ballpoint pens. The buttons of those pens keep the lid locked in place, but if they were all pressed in the box would open. The buttons can only be pushed by using a key that is provided. The key can be inserted into the frame, pushing in some of the pen buttons, and so switching those pens on or off. There are 8 ways of inserting the key, each affecting a different set of pens. The aim is to open the box by switching all the pens on.

The eight ways of applying the key affect the following pens:

- 1, 3, 4, 5
- 2, 4, 5, 6
- 2, 3, 4, 6
- 3, 4, 5, 7
- 1, 2, 5
- 2, 3, 6
- 2, 5, 6
- 3, 6, 7

There are 7 independent pens, each with two states, giving
2^{7} = 128 possible positions. All 128 positions can be reached

If all pens are off, then the following 4 moves will switch them all on: 125, 367, 256, 2456.

If you wish to affect any individual pen, then do one of the following sequences:

Pen | Moves |
---|---|

1 | 1345, 2346, 256 |

2 | 2456, 3457, 367 |

3 | 3457, 1345, 125, 367, 256 |

4 | 2346, 236, or its mirror image 2456, 256 |

5 | 3457, 1345, 367, 125, 236 |

6 | 2346, 1345, 125 |

7 | 2346, 3457, 256 |

If you wish to solve it in the minimum number of moves, then use the table below. If an odd number of the set of pens shown on the right need to be changed, then do the move on the left.

Move | Pens |
---|---|

1345 | 1, 3, 5, 6 |

3457 | 2, 3, 5, 7 |

125 | 3, 5, 6 |

367 | 2, 3, 5 |

There are now only 8 possible patterns left, including the solved one. They can be solved optimally as follows:

Pens | Moves |
---|---|

2, 3, 4, 6 | 2346 |

2, 4, 5, 6 | 2456 |

2, 3, 6 | 236 |

2, 5, 6 | 256 |

3, 5 | 2346, 2456 or 236, 256 |

4 | 2346, 236 or its mirror image 2456, 256 |

3,4,5 | 2346, 256, or its mirror image 2456, 236 |

The above table can be summarised as:

If 2 and 6 are both already correct, then do any move that changes them both. Now it can be solved in one move.

This solves the puzzle in at most 6 moves (3.25 moves on average).

This is the one of the few non-trivial puzzles in which the order that the moves are performed is unimportant (i.e. the puzzle positions form an Abelian group). This means that it is not necessary to do any particular move twice or more during the solution because we could change the order to do them one after the other, and they then cancel down to doing that move at most once. Other puzzles of this kind are the Lights Out puzzles, and Rubik's Clock. Using the methods on the Lights Out Mathematics page this puzzle can easily be analysed, resulting in the solution above.