Policy Exploration: RL searches the space of polices by determining Q for each state-action pair sa, which is the minimal cost to get to the final state from state s starting with action a.
it is assumed that the user will not change his or her mind depending on what flights are found.