Project from 42 School, AI & Algorithm branch
From any given set of number of ants, rooms and tunnels, output a turn-by-turn list of movements to get all ants from the starting room to the exit room with the least number of turns possible. Only one ant per room at a time.