You are Mr. Jones, a famous treasure hunter.
You just arrived at a site where it is said a magnificent treasure lies.
After gathering info, here is what you know
There are 10 rooms connected as shown below.
1 -> 2,3
2 -> 1,4
3 -> 1,4,5
4 -> 2,3,6
5 -> 3,6,7
6 -> 4,5,8
7 -> 5,8,9
8 -> 6,7,10
9 -> 7,10
10 -> 8,9
The treasure is in room 9 or 10.
4 rooms are filled with deadly monstrosities.
Anyone who enters a deadly room will scream themselves to death.
Although the correct path is unknown, the treasure can safely be reached.
Unfortunately, Mr. Jones is getting too old for this stuff. So he decided to hire guides to do the risky exploration for him.
He also lost most of his money due to alimonies from fooling around too much in his prime. So he must keep it cheap.
Guide model 1
Type : Kamikaze
Price : 20$
Orders willing to take : 1
Number of rooms willing to explore per orders : No limits
Guide model 2
Type : Happy-go-lucky
Price : 30$
Orders willing to take : 2
Number of rooms willing to explore per orders : 3
Guide model 3
Type : Paranoid
Price : 40$
Orders willing to take : 5
Number of rooms willing to explore per orders : 1
Definition of order
An indication of a path to follow and a list of rooms to explore starting from any 100%-cleared room of choice.
If you hear one of your guides scream, it won't give you precise indications on the location of a deadly room unless the order was to examine only one room.
After a room has been 100% cleared, you can go there without risks to yourself and give a new order to a guide if needed.
Find the cheapest way to hire guides to discover a safe path to the treasure starting from room 1 or 2. (Take into account all possible outcomes)
Let's assume life is sacred... What is the solution that will result in the fewest dead people while still trying to keep it as cheap as possible.
The guide agency is quite shifty. Odds are that if a guide gets into the treasure room before you, he will take the treasure and run away. Are changes to your plan needed to prevent that?