Challenge #369: Formula 1 Grand Prix (In)efficiency

[rsphoenix02]

Challenge 369 - Iterative macro.

[griffinwelsh]

My solution. I did not get the same answer for the second output

[Kunnathhafsal]

So much learning

[DylanBell]

Part 2 had me very confused, got there in the end.

[Carolyn]

Solved! I got a smaller answer for Part 2, but, from reading the other comments, that seems to be expected

Spoiler

To make things a little easier, I added a RecordID which I used to create the path (29-30- etc). Then when I had visited all 23 tracks, I joined to get their point info back. 

[JBevan89]

Spoiler

I got stuck for a while because the find nearest tool needed to be set to 99,999 miles range.  So for those stuck on this challenge, check out that the tool is correctly set up

[RebekaMazuchova]

I really needed this refreshment of iteration macros.

[Pilsner]

My solution:

Spoiler

Like others my part two answer was slightly lower.

Workflow:


Macro:

  

[kieranjoy]

Spoiler

New to iterative macros so I kept my initial macro build attempt in a container turned off so I could replicate the logic I needed for the actual macro. The distance for the most efficient route was just over 57k km

[mkeiffer]

My solution!  For some reason, my second answer is about 3,000 KM short of the solution answer.  

Spoiler