## Ratings

- 0 poor
- 0 mediocre
- 1 fair
- 13 good
- 53 excellent

**excellent**

Number of ratings: 67

< Sep 8th, 2009 > | xCheckPoint | ||||||

| |||||||

The trouble with trapdoors... |

- This strip has been viewed 8329 times

- 0 poor
- 0 mediocre
- 1 fair
- 13 good
- 53 excellent

Number of ratings: 67

Please log in or register to rate this strip.

## 14 Comments

/me heads off to wikihack

To ensure that the entire perimeter of that given area is checked, Duds would need to n20s at 19 squares (this checks some perimeter squares twice, of course). The probability of finding the hidden door, assuming there is only one (already an unlikely assumption), can be expressed as a binomial distribution.

At most, Dudders would find the door on the very last of the 19 squares (assuming he finds it in the 95% probability range). This means it would have taken at most 380 turns just to find a door out of the area. Although, I've made several assumptions about certain probabilities and conditions, so this may not be a likely estimate of the probability.

If I were even more bored and if it weren't 3:18 AM here, I might calculate the probability distribution for the number of turns without all those assumptions... but I need some sleep now.

Also, I hate trapdoors.

NobodySpecial: Wasn't that particular one a woozle (and wizzle once Piglet joined in)?

(Winnie-the-Pooh story for those who don't know. I used to read those all the time.)

Seriously though, Rogue had the probability of doors being secret be related to dungeon depth. Nethack appears to have, shall we say, done away with that particular idea, much to my chagrin and the chagrin of characters of mine who have died by kicking the walls in sheer frustration.

Wasn't that particular one a woozle (and wizzle once Piglet joined in)?Yes, that sounds right. I guess I just lost Pooh points. >_<