Dellis
2018-02-09, 12:09 PM
Good day!
Tomorrow I have a long play session with my poor, poor subj--- ehm, players.
I wanted to build an enigma for them.
This is what I had thought: they find a door covered in runes. They light up at touch, and a faint line runs on the surface of the door in places where they trace their fingers.
The idea is very basic, I give them the print of the door covered in runes, they have to correctly identify the runes associating them to a specific letter (i'll give them the chart after some knowledge rolls), and then trace the phrase "Behold the Amber Arca" on the sheet, touching the runes.
I wanted to add a twist, something like "you cannot trace the same line twice", or "no lines must cross", things like that, but I'm not exactly a mathematician. I wouldn't know if it was mathematically possible with that number of repeating letters, or even how to place the runes on the paper so that it is possible. This sounds like the konigsberg bridges problem, but I honestly wouldn't know if it is.
Are there any mathematicians/enigma lovers willing to help me, or barring that, anyone who has an alternative that came to mind reading me?
Tomorrow I have a long play session with my poor, poor subj--- ehm, players.
I wanted to build an enigma for them.
This is what I had thought: they find a door covered in runes. They light up at touch, and a faint line runs on the surface of the door in places where they trace their fingers.
The idea is very basic, I give them the print of the door covered in runes, they have to correctly identify the runes associating them to a specific letter (i'll give them the chart after some knowledge rolls), and then trace the phrase "Behold the Amber Arca" on the sheet, touching the runes.
I wanted to add a twist, something like "you cannot trace the same line twice", or "no lines must cross", things like that, but I'm not exactly a mathematician. I wouldn't know if it was mathematically possible with that number of repeating letters, or even how to place the runes on the paper so that it is possible. This sounds like the konigsberg bridges problem, but I honestly wouldn't know if it is.
Are there any mathematicians/enigma lovers willing to help me, or barring that, anyone who has an alternative that came to mind reading me?