Canada markets close in 2 hours 20 minutes
  • S&P/TSX

    18,331.06
    +205.34 (+1.13%)
     
  • S&P 500

    3,820.91
    +52.44 (+1.39%)
     
  • DOW

    31,345.26
    +421.12 (+1.36%)
     
  • CAD/USD

    0.7906
    +0.0008 (+0.10%)
     
  • CRUDE OIL

    66.25
    +2.42 (+3.79%)
     
  • BTC-CAD

    61,245.44
    -1,421.93 (-2.27%)
     
  • CMC Crypto 200

    968.57
    +25.40 (+2.69%)
     
  • GOLD FUTURES

    1,699.30
    -1.40 (-0.08%)
     
  • RUSSELL 2000

    2,160.66
    +13.74 (+0.64%)
     
  • 10-Yr Bond

    1.5490
    -0.0010 (-0.06%)
     
  • NASDAQ

    12,860.55
    +137.08 (+1.08%)
     
  • VOLATILITY

    26.52
    -2.05 (-7.18%)
     
  • FTSE

    6,630.52
    -20.36 (-0.31%)
     
  • NIKKEI 225

    28,864.32
    -65.79 (-0.23%)
     
  • CAD/EUR

    0.6632
    +0.0040 (+0.61%)
     

This TRU prof created a computer program to figure out the best ways to ski all of the Sun Peaks Nordic trails—in one day

·2 min read

The increasingly popular Sun Peaks Nordic trail system boasts 35 kilometres of groomed trails.

Looked at from above, they criss cross in numerous ways, with a total of 29 different intersection points and 38 individual trail sections.

Like others before him, one day several years ago Richard Taylor put his mind to determining a route that would allow him to ski all the trails in a day.

“I sat down to try to actually like draw out a route, just using the trail map, and I just got overwhelmed with how hard it was,” he said.

“You inevitably have to kind of retrace your steps a little bit and do parts of the trail network twice, just to hit everything.”

While other people might have simply called it a day and moved on, Taylor took things to the next level.

Drawing on his robust education background—Taylor teaches math and physics at Thompson Rivers University—he developed a computer program to help determine some solutions (ie. the best routes possible).

“I just kind of made it a fun weekend project, ” he said.

In the end, the program ended up running over the weekend, processing billions of options, and eventually coming up with several of the most efficient options.

Taylor said there is a certain amount of subjectivity when it comes to which is the most efficient, and that the shortest of the options clocks it at around 45 kilometres—a distance that is doable for strong cross country skiers.

Taylor added that the math involved in solving the problem draws from graph theory, and that the specific problem is actually quite well known.

“I guess the classic version of [the problem] is that you imagine a travelling salesman who needs to travel to a bunch of different cities, and needs to find the kind of most efficient way of getting to all of them so that they all get visited at least once,” he explained.

Wikipedia has a good description of this “travelling salesman problem” if you’re interested.

After producing his work,Taylor shared his findings with the Sun Peaks Nordic Club, where they received an enthusiastic reception. If interested, you can view a blog post he wrote on his findings here.

Taylor said while he was thrilled that his work got a positive reception and that some people (including his wife) have completed one of the suggested routes, ultimately he decided doing so wasn’t for him.

Having skate skied for the past six years, he would rather stick to his favourite trails, and enjoy the beautiful Noridc trail system on his own terms.

“In the end, I just kind of felt like it was boring,” he said. “I’d rather ski my favorite routes repeatedly, rather than trying to hit everything.”

Joel Barde, Local Journalism Initiative Reporter, Sun Peaks Independent News Inc.