// SPDX-License-Identifier: MIT
// Copyright (c) 2026 Incoprea
// Reach a target with the fewest standard modules
// Not compiled or tested in-world
// Setup: Place in a spare owned prim. Set positive module lengths and TARGET0..100. Owner touch runs a bounded local calculation.
// Stop / restore: Disable/remove. No travel, publication, payments or external operations occur.
// Notes: Unbounded reuse is allowed. This is exact integer arithmetic, not floating-point length matching.
// License: see LICENSE in this distribution.
// Original Incoprea. MIT. Local planning demonstration.
list LENGTHS=[3,5,8];
integer TARGET=19;
default
{
    touch_start(integer detectedCount)
    {
        if(llDetectedKey(0)!=llGetOwner())return;
        if(TARGET<0||TARGET>100)
        {
            llOwnerSay("Target0..100 required.");
            return;
        }
        list best=[0];
        integer i;
        for(i=1;i<=TARGET;++i)best+=[1000];
        integer amount;
        for(amount=1;amount<=TARGET;++amount)
        {
            integer j;
            integer minimum=1000;
            for(j=0;j<llGetListLength(LENGTHS);++j)
            {
                integer length=llList2Integer(LENGTHS,j);
                if(length<=0)
                {
                    llOwnerSay("Positive module lengths required.");
                    return;
                }
                if(length<=amount)
                {
                    integer candidate=llList2Integer(best,amount-length)+1;
                    if(candidate<minimum)minimum=candidate;
                }
            }
            best=llListReplaceList(best,[minimum],amount,amount);
        }
        integer result=llList2Integer(best,TARGET);
        if(result>=1000)llOwnerSay("No exact combination.");
        else llOwnerSay("Minimum module count="+(string)result);
    }
}