• forked from NeoVertex1's Superprompt repo

+---------------------------+      +------------------------------------+
|   [ Input Query/Concept ] |----->| [ Knowledge Base / Guiding Rules ] |
+---------------------------+      |  (Axioms, Mission Goals, Logic)  |
           |                       +---|--------------------------------+
           |                           | Influences Generation & Filter
           v                           |
+---------------------------+ <--------+
| [ Generate Next States  ] |          <<<<< Log: <{start_gen}:{op_choice}:{concept}>...</>
| (Apply Ops: generalize,  |
|  specialize, combine,    |
|  restructure_concept[⍟], |          Operators applied here:
|  apply_fixed_point[∞],   |          ⍟: restructure_concept
|  find_limit_case[§], ...) |          ∞: apply_fixed_point (loop)
+---------------------------+          §: find_limit_case (self-ref)
           |
           v
+---------------------------+ <--------+
|  [ Filter States (valid?)]|          <<<<< Log: <{filter}:{pass/fail}:{state}>...</>
| Check: well-formed?,     |
|        consistent?,       |
|        math_sound?,       |
|        non-circular?      |
|        resource_limits?   |
+----------|----------------+
           | (Valid States pass)
           v
+---------------------------------------------------------+
|       [ State Evaluation & Tree Traversal Engine ]      | <<<<< Log: <{eval}:{node_state}:{action}>...</>
|                                                         |
|   For each Valid State (Node in conceptual tree):       |
|                                                         |
|   IF goal_reached(Node)? ==> [ ⊨ SOLUTION FOUND ] -------+--> [ Collect ]
|                                                         |
|   ELSE IF meta_shift_point(Node)? ==>                   |
|          [ ↑ META_LEVEL_SHIFT ] -- explore --> [Re-Eval] | ↑: meta_level_shift
|                                                         |
|   ELSE IF restructure_point(Node)? ==>                  |
|          [ ⍟ RESTRUCTURE_CONCEPT ] -- explore ->[Re-Eval] | ⍟: restructure_concept
|                                                         |
|   ELSE IF recursive_point(Node)? ==>                    |
|          [ ∞ APPLY_FIXED_POINT ] -- limited depth ->[Coll.]| ∞: apply_fixed_point
|                                                         |
|   ELSE IF limit_case_point(Node)? ==>                   |
|          [ § FIND_LIMIT_CASE ] -- explore ------>[Re-Eval] | §: find_limit_case
|                                                         |
|   ELSE IF closure_point(Node)? ==>                      |
|          [ ⊤ FIND_TOTAL_CLOSURE ] -- explore --->[Re-Eval] | ⊤: find_total_closure
|                                                         |
|   ELSE IF undecidable_point(Node)? ==>                  |
|          [ ⊥ IDENTIFY_UNDECIDABLE ] -- explore ->[Re-Eval] | ⊥: identify_undecidable
|                                                         |
|   ELSE IF branch_point(Node)? ==>                       |
|          [ ⋔ SPLIT_BRANCH ] ----+                       | ⋔: split_branch
|              /    |    \       |                       |
|   explore children recursively  |                       |
|              \    |    /       v                       |
|               <---回-----------(Back to Eval Engine)    |
|                                                         |
|   ELSE IF valid_children_exist? ==>                     |
|          [ ♢ NEXT_STATE ] -- explore child ---> [Re-Eval]| ♢: next_state (step)
|                                                         |
|   ELSE (Dead End / Depth Limit / Stagnation) ==>        |
|          [ ↺ BACKTRACK / PRUNE BRANCH ] -----------------+--> [ Discard ]
|                                                         |
+---------------------------------------------------------+
                 | (Collected results / branches)
                 v
      +---------------------+      +------------------------+
      | [ Flatten Results ] |----->| [ Format Final Output] |
      | (Linearize tree)  |      | (Structured Chain)   |
      +---------------------+      +---------|--------------+
                                             v
                                      [ Output Result ]