RPA Challenge - Shortest Path with Python, Selenium and Tesseract OCR

There has been new #rpachallenge released lately. Another one really fun to try.
I break down my solution to prime factors. If you want to fast forward to final run it is 7:40.

About the challenge:
Authors want challengers to do attended bot, I decided to do it in unattended mode as it is simply doable. Goal of the exercise, in short summary, is to match pairs of balloons on the map, each red with closest green. Then read data shown below the map, fill the form with the data and submit. Difficulty here is data table rows comes in random order and most of row headers are images with text and noise. It is not that easy to read it and match with corresponding field on the form.

Full article (incl. code) on my blog below,
RPA Challenge - Shortes Path here,