Raw LLM Responses

Want to clarify for those hard of understanding on the arc matrixes and sudoku, that (linear programming) Action1 has cost1 because of X1 Math, A2C2X2, etc = A contains: B contains: [ X [ X Y Y Z ] Z ] These are two separate matrices so duplicates are okay, if they are both nested into a single matrix than they cannot contain the same so if A = XYZ, and B = ABC but I want to switch A = X with B = C I have to backtrack to get than switched so that anything afterword can have it's proper Alignment (If I am on D I have to go all the way back to B and switch) This counts as An Action1/Cost1/X1 move for example, if your AI was trying to cycle through all the matrices and properly align them. The reason that you don't want duplicates in a single matrix is the same as in geometry that a straight line is the shortest path between towns, If I start From: X then Y then Z it is in sequence, If I reverse it, it's still in sequence. But if I change X then Z Then Y, (Z) is in the center meaning I must go from X to Y to Z (sequence), then back to Y, because I had to pass through Y to get to Z in the middle anyway. (like I need to go to Walmart, Mcdonalds, and Kohls but I go to kohls first so I have to drive all the way back to Mcdonalds etc etc) Everything else was pretty good for such a long video very precise but that part got a little repeat confusing I think. BTW, since this is all costly one should use both breadth and depth - first searches with A* to get to the goal faster from both directions, so that things like this matrix can be solved with inference (if A = XYZ THEN C must = ABC) faster, in order to produce sequential inference actions faster. It's If, Then logic is what inference means: If A, then B.