2009-12 Mongolia Bike Challenge
All rights reserved
info@mongoliabikechallenge.com
SITE MAP | AVISO LEGAL | SM
OFFICIAL PROGRAM.
During the day the racers can roam freely but will be responsible to set up and prepare their MTB, hand over all the documentation requested and pick up their race number..
1st stage of the Mongolia Bike Challenge (see description)
Day 1: 28 July 2012
All the athlets must arrive at Ulaan Batar (UB) by this day. The vehicles of the organization will be at the airport of the capital to provide transfer to the designated hotels.During the day the racers can roam freely but will be responsible to set up and prepare their MTB, hand over all the documentation requested and pick up their race number..
Day 2: 29 July 2012
In the morning: OPENING DAY. Afternoon off. During dinner, the entire staff of the Mongolia Bike Challenge will be introduced.
Day 3: 30 July 2012
At 7:30 am. Directly from the Mongol capital (Ulaan Baatar): 1st stage of the Mongolia Bike Challenge (see description)
Day 4: 31 July 2012
2nd stage of the Mongolia Bike Challenge (see description)Day 5: 1 August 2012
3rd stage of the Mongolia Bike Challenge (see description)Day 6: 2 August 2012
4th stage of the Mongolia Bike Challenge (see description)Day 7: 3 August 2012
5th stage of the Mongolia Bike Challenge (see description)Day 8: 4 August 2012
6th stage of the Mongolia Bike Challenge (see description)Day 9: 5 August 2012
7th stage of the Mongolia Bike Challenge (see description)Day 10: 6 August 2012
Rest day .Day 11: 7 August 2012
8th stage of the Mongolia Bike Challenge (see description)Day 12: 8 August 2012
9th stage of the Mongolia Bike Challenge (see description)Day 13: 9 August 2012
10th and last stage of the Mongolia Bike Challenge (see description)Day 14: 10 August 2012
Tranfer back to Ulan Baatar. The trip will take about 6 hours. Check into the hotel and dissasemble of the bike. During dinner, official awards ceremony of the third Mongolia Bike Challenge. Day 15: 11 August 2012
Transfer to the airport and flight back to each destination.














