Weekly Challenges
Solve the challenge, share your solution and summit the ranks of our Community!Also available in | Français | Português | Español | 日本語
IDEAS WANTED
Want to get involved? We're always looking for ideas and content for Weekly Challenges.
SUBMIT YOUR IDEA
So I might have made part 2 more challenging but it optimizes the route without duplicate returns to a circuit.
Part 1 was a cake walk, part 2 took me a tad longer than I'd like to admit.
Ok, every once in a while there is a challenge I decide to go a little overboard. This is one of those times.
What started it was the answer to the second question. The provided answer gives you one result, but a number of people who know what they're doing got a different result, BUT, a number of other people who also know what they're doing got the result of the provided answer.
Couldn't just let that sit.
So, what's going on?? I must find out. So I dug in. I actually solved the answer (to the second problem) 3 different ways.
Method 1: Iterative macro uses formula tools to solve : result - 56,406
Method 2: Iterative macro uses Spatial Nearest Match with a configuration of top 25 matches: result - 56,406
Method 3: Iterative macro uses Spatial Nearest Match with a configuration of top 1 match: result - 61,998 (matches the provided result)
For method 2 & 3:
Look at the INCOMING ANCHOR of the SUM right before the end, scroll down to the bottom, and record #20 switches 2 different circuit track locations. (Suzuka, Autódromo José Carlos Pace). This creates the difference between the 2.
Oh yeah, then just because it's like that, I turned this into an Application that you can pick your starting track .... 🤓 Enjoy!
