Improved and proven optimal parking algorithm

22 октября, 2021 от Kinok Выкл

We are mistaken thinking that most of the daily tasks have already been resolved. Many of them are sometimes devilish and demanded to solve the coolest mathematics. But no one has yet managed to come up with it and prove its optimality.

A year and a half ago I wrote that one of the most day-to-day tasks (parking), finally solved, was the optimal parking algorithm. With such a task, we are confronted every day: you need to park on a large parking lot, and there are free spaces. But how to choose optimal time for parking time and check out?

T.N.

However, the authors did not disappear in their desire for mathematical perfectionism. Having spent another year, they found

The optimal strategy is such —

Ignore all open places, having passed until the middle of the row, then take the first free place.

A spoon of fighting in this barrel of honey, unfortunately, is present. «Rule 1/2», as well as «reasonable strategy», work only in a simplified ideal example (one endless series of cars and no competition for the place) for a real strategy (not perfect) the mathematical solution is still unknown. Who developed it has every chance of

So I recommend readers to think about the real strategy. The task is terribly promising. And deciding it, guaranteed to enter the history of mathematics.


Thanks for watching! Put husky I.