EDIT: As you can see below, my head immediately veered elsewhere and i just rolled with it, so instead we're doing dungeon gimmicks.
- Monty Hall dungeon: It's a dungeon based on the monty hall problem, but instead of a goat being behind the bad doors, there are men of leng.
- Game theory dungeon: When passing through the room, each party member chooses to either take X xp or take 0.5X xp. If all party members take 0.5X xp, they're all good, but if one takes X xp, the others lose 0.5X xp.
- Binary tree dungeon: Each room in the dungeon separates into two new rooms, up to some unknown but very deep length, and you are looking for an object in a specific room. If you just search every room, probably you will die before reaching the end. You need to come up with a systematic way to search the dungeon.
Ok, well I only came up with a few ideas, but I think they're pretty cool. They're not traps, but we're going to roll with it. I think the last one speaks to all of the leetcode challenges I've been having to do lately. Seriously binary trees and linked lists are the worst! That being said, even though probably nobody besides programmers will be able to solve them, I might run with the leetcode algorithm challenges as dungeon gimmicks idea in the future...
No comments:
Post a Comment