liczykon script is my script
It is bruteforce like algoritm (all posible routes) It isn't the fasters way (if you have for example 100 cities), but it gives the best possible route
It simply compares the current solution of the previous
ar01=point_distance(argument0.x, argument0.y, argument1.x, argument1.y) ar12=point_distance(argument1.x, argument1.y, argument2.x, argument2.y) ar23=point_distance(argument2.x, argument2.y, argument3.x, argument3.y) ar34=point_distance(argument3.x, argument3.y, argument4.x, argument4.y) ar45=point_distance(argument4.x, argument4.y, argument5.x, argument5.y) ar56=point_distance(argument5.x, argument5.y, argument6.x, argument6.y) ar67=point_distance(argument6.x, argument6.y, argument7.x, argument7.y) ar70=point_distance(argument7.x, argument7.y, argument0.x, argument0.y) score=ar01+ar12+ar23+ar34+ar45+ar56+ar67+ar70
if(score<lives) { global.a=argument0 global.b=argument1 global.c=argument2 global.d=argument3 global.e=argument4 global.f=argument5 global.g=argument6 global.h=argument7 global.gar01=ar01 global.gar12=ar12 global.gar23=ar23 global.gar34=ar34 global.gar45=ar45 global.gar56=ar56 global.gar67=ar67 global.gar70=ar70 lives=score; return(min(lives, score)); }
Fervi
|