@agents-eco/reasoning 0.1.0

package/dist/strategies/react.js

@@ -0,0 +1,331 @@
+import { randomUUID } from "node:crypto";
+const REACT_SYSTEM_SUFFIX = `
+
+You are a reasoning agent that solves tasks step by step using the ReAct framework.
+
+For each step, you MUST follow this format exactly:
+
+Thought: <your reasoning about what to do next>
+Action: <tool_name>
+Action Input: <JSON arguments for the tool>
+
+After receiving an observation, continue reasoning.
+
+When you have enough information to answer, respond with:
+
+Thought: <final reasoning>
+Answer: <your final answer>
+
+Rules:
+- Always think before acting.
+- Use tools when you need external information or computation.
+- If a tool call fails, reflect on why and try a different approach.
+- Be concise but thorough in your reasoning.
+- If you are unsure, state your uncertainty.
+`;
+const REFLECTION_PROMPT = `
+Reflect on your progress so far. Consider:
+1. What have you learned from the steps taken?
+2. Are you on the right track to solve the task?
+3. What should you do differently?
+4. How confident are you in your current approach?
+
+Provide a brief reflection.
+`;
+const PLAN_PROMPT = `
+Based on the task and your progress so far, create or revise your plan.
+List the remaining steps needed to solve the task.
+Be specific and actionable.
+`;
+/**
+ * ReAct (Reason + Act) strategy.
+ *
+ * Implements the multi-step reasoning loop from SmolAgents / Yao et al. 2022.
+ * Each step: Thought -> Action -> Observation, with optional reflection and planning.
+ */
+export class ReActStrategy {
+    name = "react";
+    async reason(task, systemPrompt, tools, config, backend) {
+        const startTime = Date.now();
+        const steps = [];
+        let totalPromptTokens = 0;
+        let totalCompletionTokens = 0;
+        let llmCalls = 0;
+        let toolCallCount = 0;
+        // Build system message
+        const fullSystemPrompt = systemPrompt + REACT_SYSTEM_SUFFIX + this.buildToolDescriptions(tools);
+        const messages = [
+            { role: "system", content: fullSystemPrompt },
+            { role: "user", content: task },
+        ];
+        // Optional initial planning step
+        if (config.planning) {
+            const planStep = await this.planStep(messages, backend, config, steps.length);
+            if (planStep) {
+                steps.push(planStep);
+                messages.push({ role: "assistant", content: `Plan: ${planStep.content}` });
+                totalPromptTokens += planStep.tokens?.prompt ?? 0;
+                totalCompletionTokens += planStep.tokens?.completion ?? 0;
+                llmCalls++;
+                await config.hooks?.onPlan?.(planStep.content);
+                await config.hooks?.onStep?.(planStep);
+            }
+        }
+        // ReAct loop
+        for (let i = 0; i < config.maxSteps; i++) {
+            const stepStart = Date.now();
+            // Get LLM completion
+            let response;
+            try {
+                response = await backend.complete(messages, {
+                    temperature: config.temperature ?? 0.3,
+                    maxTokens: 2048,
+                });
+            }
+            catch (err) {
+                const errorStep = this.makeStep(steps.length, "error", `LLM call failed: ${err}`, 0, stepStart);
+                steps.push(errorStep);
+                await config.hooks?.onError?.(err instanceof Error ? err : new Error(String(err)));
+                break;
+            }
+            llmCalls++;
+            totalPromptTokens += response.tokens?.prompt ?? 0;
+            totalCompletionTokens += response.tokens?.completion ?? 0;
+            const parsed = this.parseResponse(response.content);
+            // Handle final answer
+            if (parsed.answer) {
+                const answerStep = this.makeStep(steps.length, "answer", parsed.answer, 0.9, stepStart);
+                if (parsed.thought) {
+                    const thoughtStep = this.makeStep(steps.length, "thought", parsed.thought, 0.7, stepStart);
+                    steps.push(thoughtStep);
+                    await config.hooks?.onThought?.(parsed.thought);
+                    await config.hooks?.onStep?.(thoughtStep);
+                }
+                steps.push(answerStep);
+                messages.push({ role: "assistant", content: response.content });
+                await config.hooks?.onAnswer?.(parsed.answer);
+                await config.hooks?.onStep?.(answerStep);
+                return this.buildResult(parsed.answer, steps, startTime, totalPromptTokens, totalCompletionTokens, llmCalls, toolCallCount, true);
+            }
+            // Handle thought
+            if (parsed.thought) {
+                const thoughtStep = this.makeStep(steps.length, "thought", parsed.thought, 0.7, stepStart);
+                steps.push(thoughtStep);
+                await config.hooks?.onThought?.(parsed.thought);
+                await config.hooks?.onStep?.(thoughtStep);
+                if (config.verbose) {
+                    console.log(`[Step ${steps.length}] Thought: ${parsed.thought}`);
+                }
+            }
+            // Handle action (tool call)
+            if (parsed.action && parsed.actionInput) {
+                const actionStep = this.makeStep(steps.length, "action", `${parsed.action}(${JSON.stringify(parsed.actionInput)})`, 0.7, stepStart, [{ name: parsed.action, arguments: parsed.actionInput }]);
+                steps.push(actionStep);
+                await config.hooks?.onAction?.(parsed.action, parsed.actionInput);
+                await config.hooks?.onStep?.(actionStep);
+                if (config.verbose) {
+                    console.log(`[Step ${steps.length}] Action: ${parsed.action}(${JSON.stringify(parsed.actionInput)})`);
+                }
+                // Execute tool
+                const toolEntry = tools.get(parsed.action);
+                let observation;
+                let toolSuccess = true;
+                if (!toolEntry) {
+                    observation = `Error: Tool '${parsed.action}' not found. Available tools: ${Array.from(tools.keys()).join(", ")}`;
+                    toolSuccess = false;
+                }
+                else {
+                    try {
+                        observation = await toolEntry.handler(parsed.actionInput);
+                        toolCallCount++;
+                    }
+                    catch (err) {
+                        observation = `Error executing tool '${parsed.action}': ${err}`;
+                        toolSuccess = false;
+                    }
+                }
+                // Record observation
+                const obsStep = this.makeStep(steps.length, "observation", observation, toolSuccess ? 0.8 : 0.3, stepStart);
+                obsStep.toolResults = [{ name: parsed.action, content: observation, success: toolSuccess }];
+                steps.push(obsStep);
+                await config.hooks?.onObservation?.(observation);
+                await config.hooks?.onStep?.(obsStep);
+                if (config.verbose) {
+                    console.log(`[Step ${steps.length}] Observation: ${observation.slice(0, 200)}`);
+                }
+                // Add to messages
+                messages.push({ role: "assistant", content: response.content });
+                messages.push({ role: "user", content: `Observation: ${observation}` });
+            }
+            else if (!parsed.answer) {
+                // No action and no answer — LLM gave unstructured response
+                messages.push({ role: "assistant", content: response.content });
+                messages.push({
+                    role: "user",
+                    content: "Please follow the format: Thought/Action/Action Input or Thought/Answer.",
+                });
+            }
+            // Optional reflection
+            if (config.reflection && (i + 1) % 3 === 0) {
+                const reflectionStep = await this.reflectStep(messages, backend, config, steps.length);
+                if (reflectionStep) {
+                    steps.push(reflectionStep);
+                    messages.push({ role: "assistant", content: `Reflection: ${reflectionStep.content}` });
+                    totalPromptTokens += reflectionStep.tokens?.prompt ?? 0;
+                    totalCompletionTokens += reflectionStep.tokens?.completion ?? 0;
+                    llmCalls++;
+                    await config.hooks?.onReflection?.(reflectionStep.content);
+                    await config.hooks?.onStep?.(reflectionStep);
+                }
+            }
+            // Optional plan revision
+            if (config.planning && config.planInterval && (i + 1) % config.planInterval === 0) {
+                const planStep = await this.planStep(messages, backend, config, steps.length);
+                if (planStep) {
+                    steps.push(planStep);
+                    messages.push({ role: "assistant", content: `Revised Plan: ${planStep.content}` });
+                    totalPromptTokens += planStep.tokens?.prompt ?? 0;
+                    totalCompletionTokens += planStep.tokens?.completion ?? 0;
+                    llmCalls++;
+                    await config.hooks?.onPlan?.(planStep.content);
+                    await config.hooks?.onStep?.(planStep);
+                }
+            }
+        }
+        // Max steps reached — force a final answer
+        messages.push({
+            role: "user",
+            content: "You have reached the maximum number of steps. Please provide your best answer now based on what you have learned.",
+        });
+        try {
+            const finalResponse = await backend.complete(messages, { temperature: 0.2, maxTokens: 1024 });
+            llmCalls++;
+            totalPromptTokens += finalResponse.tokens?.prompt ?? 0;
+            totalCompletionTokens += finalResponse.tokens?.completion ?? 0;
+            const parsed = this.parseResponse(finalResponse.content);
+            const answer = parsed.answer || finalResponse.content;
+            const answerStep = this.makeStep(steps.length, "answer", answer, 0.5, Date.now());
+            steps.push(answerStep);
+            return this.buildResult(answer, steps, startTime, totalPromptTokens, totalCompletionTokens, llmCalls, toolCallCount, true);
+        }
+        catch {
+            return this.buildResult("Failed to produce a final answer within the step limit.", steps, startTime, totalPromptTokens, totalCompletionTokens, llmCalls, toolCallCount, false);
+        }
+    }
+    // ── Helpers ─────────────────────────────────────────
+    parseResponse(content) {
+        const result = {};
+        // Extract Thought
+        const thoughtMatch = content.match(/Thought:\s*([\s\S]*?)(?=\n(?:Action|Answer):|$)/i);
+        if (thoughtMatch)
+            result.thought = thoughtMatch[1].trim();
+        // Extract Answer
+        const answerMatch = content.match(/Answer:\s*([\s\S]*?)$/i);
+        if (answerMatch) {
+            result.answer = answerMatch[1].trim();
+            return result;
+        }
+        // Extract Action
+        const actionMatch = content.match(/Action:\s*(\S+)/i);
+        if (actionMatch)
+            result.action = actionMatch[1].trim();
+        // Extract Action Input
+        const inputMatch = content.match(/Action Input:\s*([\s\S]*?)(?=\n(?:Thought|Action|Answer):|$)/i);
+        if (inputMatch) {
+            try {
+                result.actionInput = JSON.parse(inputMatch[1].trim());
+            }
+            catch {
+                // Try to parse as key-value if not valid JSON
+                result.actionInput = { input: inputMatch[1].trim() };
+            }
+        }
+        return result;
+    }
+    buildToolDescriptions(tools) {
+        if (tools.size === 0)
+            return "\n\nYou have no tools available. Reason through the problem using your knowledge.";
+        const lines = ["\n\nAvailable tools:"];
+        for (const [name, { def }] of tools) {
+            lines.push(`- ${name}: ${def.description}`);
+            if (def.parameters && Object.keys(def.parameters).length > 0) {
+                lines.push(`  Parameters: ${JSON.stringify(def.parameters)}`);
+            }
+        }
+        return lines.join("\n");
+    }
+    async reflectStep(messages, backend, config, index) {
+        const start = Date.now();
+        try {
+            const reflectionMessages = [
+                ...messages,
+                { role: "user", content: REFLECTION_PROMPT },
+            ];
+            const response = await backend.complete(reflectionMessages, { temperature: 0.4, maxTokens: 512 });
+            return {
+                id: randomUUID(),
+                index,
+                type: "reflection",
+                content: response.content,
+                confidence: 0.6,
+                durationMs: Date.now() - start,
+                tokens: response.tokens,
+                timestamp: new Date().toISOString(),
+                metadata: {},
+            };
+        }
+        catch {
+            return null;
+        }
+    }
+    async planStep(messages, backend, config, index) {
+        const start = Date.now();
+        try {
+            const planMessages = [
+                ...messages,
+                { role: "user", content: PLAN_PROMPT },
+            ];
+            const response = await backend.complete(planMessages, { temperature: 0.3, maxTokens: 512 });
+            return {
+                id: randomUUID(),
+                index,
+                type: "plan",
+                content: response.content,
+                confidence: 0.7,
+                durationMs: Date.now() - start,
+                tokens: response.tokens,
+                timestamp: new Date().toISOString(),
+                metadata: {},
+            };
+        }
+        catch {
+            return null;
+        }
+    }
+    makeStep(index, type, content, confidence, startTime, toolCalls) {
+        return {
+            id: randomUUID(),
+            index,
+            type,
+            content,
+            confidence,
+            toolCalls,
+            durationMs: Date.now() - startTime,
+            timestamp: new Date().toISOString(),
+            metadata: {},
+        };
+    }
+    buildResult(answer, steps, startTime, promptTokens, completionTokens, llmCalls, toolCalls, success) {
+        return {
+            answer,
+            steps,
+            strategy: "react",
+            durationMs: Date.now() - startTime,
+            tokens: { prompt: promptTokens, completion: completionTokens, total: promptTokens + completionTokens },
+            llmCalls,
+            toolCalls,
+            success,
+        };
+    }
+}
+//# sourceMappingURL=react.js.map

package/dist/strategies/react.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react.js","sourceRoot":"","sources":["../../src/strategies/react.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAazC,MAAM,mBAAmB,GAAG;;;;;;;;;;;;;;;;;;;;;;;CAuB3B,CAAC;AAEF,MAAM,iBAAiB,GAAG;;;;;;;;CAQzB,CAAC;AAEF,MAAM,WAAW,GAAG;;;;CAInB,CAAC;AAEF;;;;;GAKG;AACH,MAAM,OAAO,aAAa;IACf,IAAI,GAAG,OAAgB,CAAC;IAEjC,KAAK,CAAC,MAAM,CACV,IAAY,EACZ,YAAoB,EACpB,KAA0D,EAC1D,MAAuB,EACvB,OAAmB;QAEnB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,uBAAuB;QACvB,MAAM,gBAAgB,GAAG,YAAY,GAAG,mBAAmB,GAAG,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAChG,MAAM,QAAQ,GAAkB;YAC9B,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,gBAAgB,EAAE;YAC7C,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE;SAChC,CAAC;QAEF,iCAAiC;QACjC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC9E,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC3E,iBAAiB,IAAI,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;gBAClD,qBAAqB,IAAI,QAAQ,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;gBAC1D,QAAQ,EAAE,CAAC;gBACX,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAC/C,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,aAAa;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAE7B,qBAAqB;YACrB,IAAI,QAAQ,CAAC;YACb,IAAI,CAAC;gBACH,QAAQ,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE;oBAC1C,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,GAAG;oBACtC,SAAS,EAAE,IAAI;iBAChB,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,oBAAoB,GAAG,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;gBAChG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtB,MAAM,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,CAAC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACnF,MAAM;YACR,CAAC;YAED,QAAQ,EAAE,CAAC;YACX,iBAAiB,IAAI,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;YAClD,qBAAqB,IAAI,QAAQ,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;YAE1D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAEpD,sBAAsB;YACtB,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAClB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;gBACxF,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;oBAC3F,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBACxB,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;oBAChD,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,WAAW,CAAC,CAAC;gBAC5C,CAAC;gBACD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;gBAChE,MAAM,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC9C,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC;gBAEzC,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;YACpI,CAAC;YAED,iBAAiB;YACjB,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;gBAC3F,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACxB,MAAM,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAChD,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,WAAW,CAAC,CAAC;gBAC1C,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,MAAM,cAAc,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;gBACxC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAC9B,KAAK,CAAC,MAAM,EAAE,QAAQ,EACtB,GAAG,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,EACzD,GAAG,EAAE,SAAS,EACd,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,WAAW,EAAE,CAAC,CACzD,CAAC;gBACF,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvB,MAAM,MAAM,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;gBAClE,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC;gBAEzC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,MAAM,aAAa,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACxG,CAAC;gBAED,eAAe;gBACf,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3C,IAAI,WAAmB,CAAC;gBACxB,IAAI,WAAW,GAAG,IAAI,CAAC;gBAEvB,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,WAAW,GAAG,gBAAgB,MAAM,CAAC,MAAM,iCAAiC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClH,WAAW,GAAG,KAAK,CAAC;gBACtB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC;wBACH,WAAW,GAAG,MAAM,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;wBAC1D,aAAa,EAAE,CAAC;oBAClB,CAAC;oBAAC,OAAO,GAAG,EAAE,CAAC;wBACb,WAAW,GAAG,yBAAyB,MAAM,CAAC,MAAM,MAAM,GAAG,EAAE,CAAC;wBAChE,WAAW,GAAG,KAAK,CAAC;oBACtB,CAAC;gBACH,CAAC;gBAED,qBAAqB;gBACrB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;gBAC5G,OAAO,CAAC,WAAW,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;gBAC5F,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACpB,MAAM,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,WAAW,CAAC,CAAC;gBACjD,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC;gBAEtC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,SAAS,KAAK,CAAC,MAAM,kBAAkB,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClF,CAAC;gBAED,kBAAkB;gBAClB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;gBAChE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,gBAAgB,WAAW,EAAE,EAAE,CAAC,CAAC;YAC1E,CAAC;iBAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC1B,2DAA2D;gBAC3D,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;gBAChE,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,MAAM;oBACZ,OAAO,EAAE,0EAA0E;iBACpF,CAAC,CAAC;YACL,CAAC;YAED,sBAAsB;YACtB,IAAI,MAAM,CAAC,UAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBACvF,IAAI,cAAc,EAAE,CAAC;oBACnB,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,eAAe,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;oBACvF,iBAAiB,IAAI,cAAc,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;oBACxD,qBAAqB,IAAI,cAAc,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;oBAChE,QAAQ,EAAE,CAAC;oBACX,MAAM,MAAM,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;oBAC3D,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,cAAc,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;YAED,yBAAyB;YACzB,IAAI,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,YAAY,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,YAAY,KAAK,CAAC,EAAE,CAAC;gBAClF,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC9E,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,iBAAiB,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;oBACnF,iBAAiB,IAAI,QAAQ,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;oBAClD,qBAAqB,IAAI,QAAQ,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;oBAC1D,QAAQ,EAAE,CAAC;oBACX,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;oBAC/C,MAAM,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,mHAAmH;SAC7H,CAAC,CAAC;QAEH,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAC9F,QAAQ,EAAE,CAAC;YACX,iBAAiB,IAAI,aAAa,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC;YACvD,qBAAqB,IAAI,aAAa,CAAC,MAAM,EAAE,UAAU,IAAI,CAAC,CAAC;YAE/D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACzD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,aAAa,CAAC,OAAO,CAAC;YACtD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YAClF,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAEvB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,CAAC,CAAC;QAC7H,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC,WAAW,CACrB,yDAAyD,EACzD,KAAK,EAAE,SAAS,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,QAAQ,EAAE,aAAa,EAAE,KAAK,CAC3F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,uDAAuD;IAE/C,aAAa,CAAC,OAAe;QAMnC,MAAM,MAAM,GAKR,EAAE,CAAC;QAEP,kBAAkB;QAClB,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;QACvF,IAAI,YAAY;YAAE,MAAM,CAAC,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAE1D,iBAAiB;QACjB,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5D,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,iBAAiB;QACjB,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,kBAAkB,CAAC,CAAC;QACtD,IAAI,WAAW;YAAE,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAEvD,uBAAuB;QACvB,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAC,+DAA+D,CAAC,CAAC;QAClG,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC;gBACH,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACxD,CAAC;YAAC,MAAM,CAAC;gBACP,8CAA8C;gBAC9C,MAAM,CAAC,WAAW,GAAG,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,qBAAqB,CAAC,KAA0D;QACtF,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,mFAAmF,CAAC;QAEjH,MAAM,KAAK,GAAG,CAAC,sBAAsB,CAAC,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5C,IAAI,GAAG,CAAC,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7D,KAAK,CAAC,IAAI,CAAC,iBAAiB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,KAAK,CAAC,WAAW,CACvB,QAAuB,EACvB,OAAmB,EACnB,MAAuB,EACvB,KAAa;QAEb,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,kBAAkB,GAAkB;gBACxC,GAAG,QAAQ;gBACX,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE;aAC7C,CAAC;YACF,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,kBAAkB,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;YAClG,OAAO;gBACL,EAAE,EAAE,UAAU,EAAE;gBAChB,KAAK;gBACL,IAAI,EAAE,YAAY;gBAClB,OAAO,EAAE,QAAQ,CAAC,OAAO;gBACzB,UAAU,EAAE,GAAG;gBACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;gBAC9B,MAAM,EAAE,QAAQ,CAAC,MAAM;gBACvB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACnC,QAAQ,EAAE,EAAE;aACb,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,QAAQ,CACpB,QAAuB,EACvB,OAAmB,EACnB,MAAuB,EACvB,KAAa;QAEb,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC;YACH,MAAM,YAAY,GAAkB;gBAClC,GAAG,QAAQ;gBACX,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE;aACvC,CAAC;YACF,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,QAAQ,CAAC,YAAY,EAAE,EAAE,WAAW,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;YAC5F,OAAO;gBACL,EAAE,EAAE,UAAU,EAAE;gBAChB,KAAK;gBACL,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,QAAQ,CAAC,OAAO;gBACzB,UAAU,EAAE,GAAG;gBACf,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;gBAC9B,MAAM,EAAE,QAAQ,CAAC,MAAM;gBACvB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;gBACnC,QAAQ,EAAE,EAAE;aACb,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAEO,QAAQ,CACd,KAAa,EACb,IAA2B,EAC3B,OAAe,EACf,UAAkB,EAClB,SAAiB,EACjB,SAAsB;QAEtB,OAAO;YACL,EAAE,EAAE,UAAU,EAAE;YAChB,KAAK;YACL,IAAI;YACJ,OAAO;YACP,UAAU;YACV,SAAS;YACT,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAClC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,QAAQ,EAAE,EAAE;SACb,CAAC;IACJ,CAAC;IAEO,WAAW,CACjB,MAAc,EACd,KAAsB,EACtB,SAAiB,EACjB,YAAoB,EACpB,gBAAwB,EACxB,QAAgB,EAChB,SAAiB,EACjB,OAAgB;QAEhB,OAAO;YACL,MAAM;YACN,KAAK;YACL,QAAQ,EAAE,OAAO;YACjB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAClC,MAAM,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,gBAAgB,EAAE,KAAK,EAAE,YAAY,GAAG,gBAAgB,EAAE;YACtG,QAAQ;YACR,SAAS;YACT,OAAO;SACR,CAAC;IACJ,CAAC;CACF"}

package/dist/strategies/tot.d.ts

@@ -0,0 +1,25 @@
+import type { ReasoningStrategy, ReasoningConfig, ReasoningResult, ToolDef, ToolHandler, LLMBackend } from "../types.js";
+/**
+ * Tree-of-Thought (ToT) strategy.
+ *
+ * Explores multiple reasoning paths in a tree structure.
+ * Uses beam search to keep the top-k most promising branches.
+ * Each branch is scored by the LLM or a heuristic.
+ */
+export declare class TreeOfThoughtStrategy implements ReasoningStrategy {
+    readonly name: "tot";
+    reason(task: string, systemPrompt: string, tools: Map<string, {
+        def: ToolDef;
+        handler: ToolHandler;
+    }>, config: ReasoningConfig, backend: LLMBackend): Promise<ReasoningResult>;
+    private generateBranches;
+    private llmScore;
+    private heuristicScore;
+    private wordOverlap;
+    private solve;
+    private getPath;
+    private findBranch;
+    private findBranchById;
+    private buildResult;
+}
+//# sourceMappingURL=tot.d.ts.map

package/dist/strategies/tot.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tot.d.ts","sourceRoot":"","sources":["../../src/strategies/tot.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EACV,iBAAiB,EACjB,eAAe,EACf,eAAe,EAIf,OAAO,EACP,WAAW,EACX,UAAU,EAEX,MAAM,aAAa,CAAC;AA0BrB;;;;;;GAMG;AACH,qBAAa,qBAAsB,YAAW,iBAAiB;IAC7D,QAAQ,CAAC,IAAI,EAAG,KAAK,CAAU;IAEzB,MAAM,CACV,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,MAAM,EACpB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE;QAAE,GAAG,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,WAAW,CAAA;KAAE,CAAC,EAC1D,MAAM,EAAE,eAAe,EACvB,OAAO,EAAE,UAAU,GAClB,OAAO,CAAC,eAAe,CAAC;YA4Hb,gBAAgB;YA2ChB,QAAQ;IAoBtB,OAAO,CAAC,cAAc;IAyBtB,OAAO,CAAC,WAAW;YAYL,KAAK;IA0BnB,OAAO,CAAC,OAAO;IAOf,OAAO,CAAC,UAAU;IAUlB,OAAO,CAAC,cAAc;IAStB,OAAO,CAAC,WAAW;CAoBpB"}

package/dist/strategies/tot.js

@@ -0,0 +1,274 @@
+import { randomUUID } from "node:crypto";
+const TOT_GENERATE_PROMPT = `Given the problem and the current reasoning path, generate {branchFactor} distinct next reasoning steps.
+Each step should explore a different approach or angle.
+
+Format each as:
+Option 1: <reasoning step>
+Option 2: <reasoning step>
+...
+
+Be creative and consider diverse approaches.`;
+const TOT_EVALUATE_PROMPT = `Evaluate the following reasoning step on a scale of 0.0 to 1.0.
+Consider: logical soundness, relevance to the problem, likelihood of leading to a correct answer, and novelty.
+
+Reasoning step: {thought}
+
+Respond with only a number between 0.0 and 1.0.`;
+const TOT_SOLVE_PROMPT = `Based on the following reasoning path, provide a final answer.
+
+Reasoning path:
+{path}
+
+Final Answer:`;
+/**
+ * Tree-of-Thought (ToT) strategy.
+ *
+ * Explores multiple reasoning paths in a tree structure.
+ * Uses beam search to keep the top-k most promising branches.
+ * Each branch is scored by the LLM or a heuristic.
+ */
+export class TreeOfThoughtStrategy {
+    name = "tot";
+    async reason(task, systemPrompt, tools, config, backend) {
+        const startTime = Date.now();
+        const steps = [];
+        let totalPromptTokens = 0;
+        let totalCompletionTokens = 0;
+        let llmCalls = 0;
+        const totConfig = config;
+        const branchFactor = totConfig.branchFactor ?? 3;
+        const maxDepth = totConfig.maxDepth ?? 4;
+        const beamWidth = totConfig.beamWidth ?? 2;
+        // Root node
+        const root = {
+            id: randomUUID(),
+            thought: task,
+            score: 1.0,
+            depth: 0,
+            children: [],
+            isTerminal: false,
+        };
+        // Beam search
+        let currentBeam = [root];
+        for (let depth = 1; depth <= maxDepth; depth++) {
+            const allCandidates = [];
+            for (const parent of currentBeam) {
+                // Generate branches
+                const path = this.getPath(root, parent.id);
+                const branches = await this.generateBranches(task, systemPrompt, path, branchFactor, backend);
+                llmCalls++;
+                totalPromptTokens += branches.tokens.prompt;
+                totalCompletionTokens += branches.tokens.completion;
+                // Score each branch
+                for (const thought of branches.thoughts) {
+                    let score;
+                    if (totConfig.scoringMethod === "heuristic") {
+                        score = this.heuristicScore(thought, path);
+                    }
+                    else {
+                        const scoreResult = await this.llmScore(thought, backend);
+                        score = scoreResult.score;
+                        llmCalls++;
+                        totalPromptTokens += scoreResult.tokens.prompt;
+                        totalCompletionTokens += scoreResult.tokens.completion;
+                    }
+                    const branch = {
+                        id: randomUUID(),
+                        parentId: parent.id,
+                        thought,
+                        score,
+                        depth,
+                        children: [],
+                        isTerminal: depth === maxDepth,
+                    };
+                    parent.children.push(branch);
+                    allCandidates.push(branch);
+                    // Record step
+                    const step = {
+                        id: randomUUID(),
+                        index: steps.length,
+                        type: "thought",
+                        content: `[Depth ${depth}, Score ${score.toFixed(2)}] ${thought}`,
+                        confidence: score,
+                        durationMs: 0,
+                        timestamp: new Date().toISOString(),
+                        metadata: { depth, branchId: branch.id, parentId: parent.id },
+                    };
+                    steps.push(step);
+                    await config.hooks?.onThought?.(thought);
+                    await config.hooks?.onStep?.(step);
+                }
+            }
+            // Beam selection: keep top-k branches
+            allCandidates.sort((a, b) => b.score - a.score);
+            currentBeam = allCandidates.slice(0, beamWidth);
+            if (config.verbose) {
+                console.log(`[ToT Depth ${depth}] ${allCandidates.length} candidates, kept top ${beamWidth}`);
+                for (const b of currentBeam) {
+                    console.log(`  Score ${b.score.toFixed(2)}: ${b.thought.slice(0, 80)}`);
+                }
+            }
+        }
+        // Get the best terminal branch and solve
+        const bestBranch = currentBeam[0];
+        if (!bestBranch) {
+            return this.buildResult("Unable to find a solution.", steps, startTime, totalPromptTokens, totalCompletionTokens, llmCalls, false);
+        }
+        const bestPath = this.getPath(root, bestBranch.id);
+        const solveResult = await this.solve(task, systemPrompt, bestPath, backend);
+        llmCalls++;
+        totalPromptTokens += solveResult.tokens.prompt;
+        totalCompletionTokens += solveResult.tokens.completion;
+        const answerStep = {
+            id: randomUUID(),
+            index: steps.length,
+            type: "answer",
+            content: solveResult.answer,
+            confidence: bestBranch.score,
+            durationMs: Date.now() - startTime,
+            timestamp: new Date().toISOString(),
+            metadata: { bestBranchId: bestBranch.id, pathLength: bestPath.length },
+        };
+        steps.push(answerStep);
+        await config.hooks?.onAnswer?.(solveResult.answer);
+        await config.hooks?.onStep?.(answerStep);
+        return this.buildResult(solveResult.answer, steps, startTime, totalPromptTokens, totalCompletionTokens, llmCalls, true);
+    }
+    // ── Branch Generation ───────────────────────────────
+    async generateBranches(task, systemPrompt, path, branchFactor, backend) {
+        const pathStr = path.length > 0
+            ? `Current reasoning path:\n${path.map((p, i) => `${i + 1}. ${p}`).join("\n")}\n\n`
+            : "";
+        const prompt = TOT_GENERATE_PROMPT.replace("{branchFactor}", String(branchFactor));
+        const messages = [
+            { role: "system", content: systemPrompt },
+            { role: "user", content: `Problem: ${task}\n\n${pathStr}${prompt}` },
+        ];
+        const response = await backend.complete(messages, { temperature: 0.8, maxTokens: 1024 });
+        // Parse options
+        const thoughts = [];
+        const optionPattern = /Option\s+\d+:\s*([\s\S]*?)(?=Option\s+\d+:|$)/gi;
+        let match;
+        while ((match = optionPattern.exec(response.content)) !== null) {
+            const text = match[1].trim();
+            if (text)
+                thoughts.push(text);
+        }
+        // Fallback: split by newlines if no options found
+        if (thoughts.length === 0) {
+            const lines = response.content.split("\n").filter((l) => l.trim().length > 10);
+            thoughts.push(...lines.slice(0, branchFactor));
+        }
+        return {
+            thoughts: thoughts.slice(0, branchFactor),
+            tokens: { prompt: response.tokens?.prompt ?? 0, completion: response.tokens?.completion ?? 0 },
+        };
+    }
+    // ── Scoring ─────────────────────────────────────────
+    async llmScore(thought, backend) {
+        const prompt = TOT_EVALUATE_PROMPT.replace("{thought}", thought);
+        const messages = [{ role: "user", content: prompt }];
+        try {
+            const response = await backend.complete(messages, { temperature: 0.1, maxTokens: 16 });
+            const scoreMatch = response.content.match(/(\d+\.?\d*)/);
+            const score = scoreMatch ? Math.max(0, Math.min(1, parseFloat(scoreMatch[1]))) : 0.5;
+            return {
+                score,
+                tokens: { prompt: response.tokens?.prompt ?? 0, completion: response.tokens?.completion ?? 0 },
+            };
+        }
+        catch {
+            return { score: 0.5, tokens: { prompt: 0, completion: 0 } };
+        }
+    }
+    heuristicScore(thought, path) {
+        let score = 0.5;
+        // Length bonus (not too short, not too long)
+        const words = thought.split(/\s+/).length;
+        if (words >= 10 && words <= 100)
+            score += 0.1;
+        // Novelty: penalize if too similar to existing path
+        for (const p of path) {
+            const overlap = this.wordOverlap(thought, p);
+            if (overlap > 0.8)
+                score -= 0.2;
+        }
+        // Structure bonus: contains reasoning indicators
+        const indicators = ["because", "therefore", "however", "if", "then", "since", "given"];
+        for (const ind of indicators) {
+            if (thought.toLowerCase().includes(ind)) {
+                score += 0.05;
+                break;
+            }
+        }
+        return Math.max(0, Math.min(1, score));
+    }
+    wordOverlap(a, b) {
+        const wordsA = new Set(a.toLowerCase().split(/\s+/));
+        const wordsB = new Set(b.toLowerCase().split(/\s+/));
+        let overlap = 0;
+        for (const w of wordsA) {
+            if (wordsB.has(w))
+                overlap++;
+        }
+        return overlap / Math.max(wordsA.size, wordsB.size);
+    }
+    // ── Solve ───────────────────────────────────────────
+    async solve(task, systemPrompt, path, backend) {
+        const pathStr = path.map((p, i) => `${i + 1}. ${p}`).join("\n");
+        const prompt = TOT_SOLVE_PROMPT.replace("{path}", pathStr);
+        const messages = [
+            { role: "system", content: systemPrompt },
+            { role: "user", content: `Problem: ${task}\n\n${prompt}` },
+        ];
+        const response = await backend.complete(messages, { temperature: 0.2, maxTokens: 1024 });
+        const answerMatch = response.content.match(/Final Answer:\s*([\s\S]*?)$/i);
+        const answer = answerMatch ? answerMatch[1].trim() : response.content.trim();
+        return {
+            answer,
+            tokens: { prompt: response.tokens?.prompt ?? 0, completion: response.tokens?.completion ?? 0 },
+        };
+    }
+    // ── Path Extraction ─────────────────────────────────
+    getPath(root, targetId) {
+        const path = [];
+        const found = this.findBranch(root, targetId, path);
+        if (found)
+            return path.map((id) => this.findBranchById(root, id)?.thought ?? "").filter(Boolean);
+        return [];
+    }
+    findBranch(node, targetId, path) {
+        path.push(node.id);
+        if (node.id === targetId)
+            return true;
+        for (const child of node.children) {
+            if (this.findBranch(child, targetId, path))
+                return true;
+        }
+        path.pop();
+        return false;
+    }
+    findBranchById(node, id) {
+        if (node.id === id)
+            return node;
+        for (const child of node.children) {
+            const found = this.findBranchById(child, id);
+            if (found)
+                return found;
+        }
+        return null;
+    }
+    buildResult(answer, steps, startTime, promptTokens, completionTokens, llmCalls, success) {
+        return {
+            answer,
+            steps,
+            strategy: "tot",
+            durationMs: Date.now() - startTime,
+            tokens: { prompt: promptTokens, completion: completionTokens, total: promptTokens + completionTokens },
+            llmCalls,
+            toolCalls: 0,
+            success,
+        };
+    }
+}
+//# sourceMappingURL=tot.js.map