This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
We've recently made an accessibility improvement to the community and therefore posts without any content are no longer allowed. Please use the spoiler feature or add a short message in the message body in order to submit your weekly challenge.
We are currently experiencing an issue with Email verification at this time and working towards a solution. Should you encounter this issue, please click on the "Send Verification Button" a second time and the request should go through. If the issue still persists for you, please email email@example.com for assistance.
There are some great videos on the iterative macro within the Alteryx community. The solution will be posted next Monday - happy to explain further after the solution is posted if there are any questions.
Enjoyed doing this challenge, but now it's gotten me rethinking the old travelling salesman problem. This algorithm is obviously not the way to do it. Just looking at the resulting path, was able to eyeball a route that cut about 8 miles off the travel distance. Hopefully, some day I'll find some time to play with this some more...