"One way race logic strives to save energy is by addressing the shortest-path problem. In one scenario, cars set off in multiple directions trying to find the fastest route. When the first car arrives, all the other cars stop, saving energy.Credit: B. Hayes and J. Wang/NIST" (Nist.gov/Brain-Inspired Computing Can Help Us Create Faster, More Energy-Efficient Devices — If We Win the Race) When we select a route for data, we always select the shortest possible route. But what if there are two routes whose length is the same? That causes a situation in which the data packages that travel through those routes can reach the same point. At the same time. The situation is similar with two cars that reach at the same moment the same parking lot. That thing causes conflict in the system. If those cars are lorries, that must only deliver material to the house the system can tell that another driver can go to take some coffee. And the other car can deliver its cargo. In computer systems