2 variants of number path puzzles.
1st. You have a grid of combos with numbers on them. Your goal is to connect start combo and end combo in such a way that all adjacent combos in path are numerically adjacent, like 1-2-3-2-3-4 etc…
2nd. You have a grid of combos with numbers and mathematical symbols drawn on them. The goal is to connect start and end combo sp the path forms a valid mathematical expression. Like 1+1=2. If you succefully pass inequality comparsion checkpoint ("<, >, <=, >=") the current total becomes number you stepped on. If you step on adjacent numbers, the current total will be multpled by 10 and last stepped number will be added to total, as if you input number on calculator.
Stand on valid number and Press Ex1 to perform a step. Steping on traced path and pressing Ex1 will take back all steps up to that spot on path.
1. Set up sequence of combos for Math tiles, the sequence must be following: ">=, <=, >, <, =, /, *, -, +, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9";
2. Build the puzzle using combos from step 1. Examples of puzzles are shown in demo.
3. Flag all combos used for puzzle with CF_MATH_PATH_PUZZLE combo flag.
4. Place invisible FFC with combo depicting "0" as combo and assigned script at starting position.
D0 - 0 - adjacent number path sequence, 1 - math expression composing puzzle.
D1 - target combo position to solve the puzzle.
D2 - X coordinate to render current total using FONT_MATH_PATH_TOTAL
D3 - Y coordinate to render current total using FONT_MATH_PATH_TOTAL
ffc script NumberMatchPath{
