The optimal number of alternatives at a choice point with travel time considered

The problem of optimal design is considered for tasks that can be represented as n choice points with a_i alternatives per choice point. Examples are mazes or multiple choice tests. Some fixed time t′ elapses between choice points, say traveling from one to the other or reading a question, and additional time t is spent considering each alternative at the choice point. For fixed total time, the goal is to find the optimum number of choice points and the optimum number of alternatives at each choice point. In general, the longer the time spent between choice points, the greater the optimum number of alternatives at each point.