// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Draft a short exhibit tour greedily
// Not compiled or tested in-world
// Setup: Place in a spare owned prim. Set POINTS with2..10 stops; stop0 is the start. Owner touch runs a bounded local calculation.
// Stop / restore: Disable/remove. No travel, publication, payments or external operations occur.
// Notes: This is a heuristic, not the shortest traveling-salesperson tour. It reports an open path and total length.
// License: see LICENSE in this distribution.
// Original Incoprea. MIT. Local planning demonstration.
list POINTS=[<0.0,0.0,0.0>,<5.0,0.0,0.0>,<2.0,3.0,0.0>,<7.0,5.0,0.0>,<1.0,6.0,0.0>];
default
{
    touch_start(integer detectedCount)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        integer n=llGetListLength(POINTS);
        if(n<2||n>10)
        {
            llOwnerSay("Use2..10 stops.");
            return;
        }
        integer visited=1;
        integer current;
        list path=[0];
        float total;
        integer step;
        for(step=1;step<n;++step)
        {
            integer best=-1;
            float distance=1000000.0;
            integer i;
            for(i=0;i<n;++i)if(!(visited&(1<<i)))
            {
                float d=llVecDist(llList2Vector(POINTS,current),llList2Vector(POINTS,i));
                if(d<distance)
                {
                    distance=d;
                    best=i;
                }
            }
            if(best<0)
            {
                llOwnerSay("No stop under distance limit.");
                return;
            }
            visited=visited|(1<<best);
            path+=[best];
            total+=distance;
            current=best;
        }
        llOwnerSay("Draft tour="+llDumpList2String(path," -> ")+" length="+(string)total);
    }
}