Routes to Christmas an orienteering visualisation.

You may have spotted a post on Facebook from us the other day about the Route to Christmas challenge on the World of O(rienteering ) website??

Well Mike and myself are having a bit of fun on the Daily navigation challenge, we each (along with 100’s of others) plan the route we would take to get between the Control Points (CP’s) and then to compare them afterwards.

We’re leaving a time lag between picking our routes and posting them so you can have fun with the other days too.

Fancy some #adventureracing navigation games with #TriHarderAR? Click To Tweet

Here’s the map and link to Day 1:

Jan Prochazka gives us the introduction to the leg: As I am looking to the future, this leg is one of the best examples on the way towards EOC 2016. I have chosen one leg from the Czech long distance Champs 2015. There were about 3-5 interesting legs, but this one I did extremely well, and I was even surprised by the margin to the second best time. The terrain of Czech long distance 2015 was similar to EOC 2016 long. However, this terrain is situated on other side of the Jeseniky mountains and have in overall higher altitude. This leg comes up after 70 minutes of running, and its highest parts are over 1000 meters above see level – a last physically challenging leg of the course.

Our chosen routes:

Route to Christmas Day 1 2015 World of O News

Mike – Don’t fancy the leg sapping steep route. Contour around the tree-line and punch through the saddle.

Sean – Working across the contours will be quicker and using fences and streams as handrails to get to the second saddle where a sharp blast uphill will allow a direct drop down to the CP16

Bearing in mind we don’t have route maps or any information on restricted roads etc we are workign off our working knowledge of most likely case scenarios of race rules. No main road, that kind of thing. So either that road is out of play or Mike went for pints 😉

Stay tuned for Day 2 & 3 coming up as a double feature!

%d bloggers like this: