# Terrorists transporting Hostages through the desert

You belong to an intelligence agency that is monitoring some terrorists. There are three of them in the Hideout A with three hostages and a bomb. Unfortunately, this hideout is extremely secure. But there is a chance to get them: inside informants report that they are leaving for the Hideout B in the next morning. As soon as they get all there (terrorists and hostages), the agency is going to surprise them. What you know is:

• There are 3 terrorists, 3 hostages and 1 bomb to be transported;
• They only have one horse that will transport them from Hideout A to Hideout B or back, if needed;
• The horse needs a rider (terrorist or hostage) to move;
• The horse only supports 2 persons, or 1 person and the bomb;
• The journey takes the whole day, and the horse needs to rest until the next morning;
• If there are more hostages than terrorists in one hideout, they will fight, so the terrorists will plan to avoid this. Hostages alone are permitted, though;
• The hostages cannot escape in the desert, so they will ride the horse to the correct hideout as requested.

So, assuming that the terrorists are perfect strategists, what would be the minimum number of days for them to leave completely the Hideout A and move all (terrorists, hostages and the bomb) to the Hideout B?

• So they made a perfect plan to move everything to Hideout B, and then get surprised? And what is "my" job (as intelligence agency) here? Just monitoring them? Or helping them do the planning? Oct 30, 2019 at 0:45

My try:

I will assume that, in the rule "if there are more hostages than terrorists in one Hideout...", it doesn't count if there are no terrorists in that Hideout. Otherwise the game is simply impossible.

Terrorists = T, Hostages = H, Bomb = B. The sequence of horse-riders for each day:

TH, T, TB, T, HH, H, TT, TH, TT, H, HH, H, HH