Mountain riddle

If you like to play, a challenge like this is perfect for you. And if you remember the TV competition Carousel, you already know what the rules are.

The object of the challenge is to uncover all the letters of the riddle by sequentially visiting the vertices whose initial letters appear in the riddle. For multi-word names, only the 1st letter always applies (e.g., U Maple = U). If a given letter is part of the mystery, it will appear as many times as it appears in the mystery; there is no need to visit multiple vertices starting with that letter.

Example. If the letter J is not part of the mystery, it will not appear in the mystery, but will show up under the mystery as a tried and unneeded letter (we'll finish it in a few days).

For the challenge, don't forget to examine the letter conversion chart. For example, Ä will count as A, but Č will not count as C, only Č. For C, you'll need to visit the vertex starting directly at C.

You don't know ahead of time what specific letters are in the puzzle, you only have an indication of how many letters in total make up the puzzle. For example, if you declassify the letter A, it will fill in all the places in the puzzle, and it is possible that it will fill in dozens of free spaces :-).

We believe that the mountain mystery will be a very popular challenge and that's why we have prepared three mysteries! Each new one will open only when you have completely revealed the text of the previous one. The progress of the mystery is always updated when you come here to the challenge page.

The challenge can be completed in any language, however, the texts of all mysteries are in Czech only. Those who do not know Czech will not enjoy the challenge. If there is a great interest in another language, we can try to complete the challenge during the year.