eyeling 1.19.4 → 1.19.6

package/examples/extra/output/path-discovery.txt

@@ -0,0 +1,28 @@
+=== Answer ===
+The path-discovery case finds every simple route from Ostend-Bruges International Airport to Václav Havel Airport Prague with at most two stopovers.
+
+=== Reason Why ===
+The program builds adjacency lists from the full airport graph, then runs a depth-limited DFS that never revisits an airport.
+airports      : 7698
+flights       : 37274
+source        : Ostend-Bruges International Airport
+destination   : Václav Havel Airport Prague
+max stopovers : 2
+
+Route #1
+  Stopovers : 2
+  Airports  : Ostend-Bruges International Airport -> Liège Airport -> Heraklion International Nikos Kazantzakis Airport -> Václav Havel Airport Prague
+
+Route #2
+  Stopovers : 2
+  Airports  : Ostend-Bruges International Airport -> Liège Airport -> Diagoras Airport -> Václav Havel Airport Prague
+
+Route #3
+  Stopovers : 2
+  Airports  : Ostend-Bruges International Airport -> Liège Airport -> Palma De Mallorca Airport -> Václav Havel Airport Prague
+
+=== Check ===
+all routes within stopover bound : yes
+all routes are simple paths      : yes
+all routes match endpoints       : yes
+route set matches known answer   : yes

package/examples/extra/output/pn-junction-tunneling.txt

@@ -0,0 +1,15 @@
+=== Answer ===
+In this toy PN-junction tunneling model, heavy doping narrows the depletion region enough for a tunneling window that rises to a peak and then falls.
+
+=== Reason Why ===
+We count exact state overlap while forward bias shifts the empty P-side levels.
+bias -> overlap current proxy : 0->2, 1->3, 2->4, 3->3, 4->2, 5->1, 6->0
+peak point                    : 2 -> 4
+high-bias point               : 6 -> 0
+
+=== Check ===
+heavily doped barrier is narrower : yes
+peak occurs before overlap closes : yes
+negative differential region      : yes
+high-bias overlap closes          : yes
+peak equals full overlap          : yes

package/examples/extra/output/polynomial.txt

@@ -0,0 +1,20 @@
+=== Answer ===
+Both polynomial examples are solved consistently: the computed roots satisfy the source polynomials and reconstruct the original coefficients.
+
+=== Reason Why ===
+For each quartic, the program solves for the roots numerically, substitutes them back, and rebuilds the polynomial from those roots.
+
+Example #1 (real quartic)
+roots               : 4, 3, 2, 1
+residuals           : 0, 0, 0, 0
+reconstruction ok   : yes
+roots valid         : yes
+
+Example #2 (complex quartic)
+roots               : 3 + 2i, 1i, 1 + 1i, 5 + 1i
+residuals           : 0, 0, 0, 0
+reconstruction ok   : yes
+roots valid         : yes
+
+=== Check ===
+all examples valid  : yes

package/examples/extra/output/sudoku.txt

@@ -0,0 +1,47 @@
+=== Answer ===
+The puzzle is solved, and the completed grid is the unique valid Sudoku solution.
+
+Puzzle
+1 . . | . . 7 | . 9 . 
+. 3 . | . 2 . | . . 8 
+. . 9 | 6 . . | 5 . . 
+
+. . 5 | 3 . . | 9 . . 
+. 1 . | . 8 . | . . 2 
+6 . . | . . 4 | . . . 
+
+3 . . | . . . | . 1 . 
+. 4 . | . . . | . . 7 
+. . 7 | . . . | 3 . . 
+
+Completed grid
+1 6 2 | 8 5 7 | 4 9 3 
+5 3 4 | 1 2 9 | 6 7 8 
+7 8 9 | 6 4 3 | 5 2 1 
+
+4 7 5 | 3 1 2 | 9 8 6 
+9 1 3 | 5 8 6 | 7 4 2 
+6 2 8 | 7 9 4 | 1 3 5 
+
+3 5 6 | 4 7 8 | 2 1 9 
+2 4 1 | 9 3 5 | 8 6 7 
+8 9 7 | 2 6 1 | 3 5 4 
+
+=== Reason Why ===
+The solver combines constraint propagation with depth-first search. It fills forced singles immediately and branches on the blank cell with the fewest candidates.
+givens             : 23
+blanks             : 58
+forced placements  : 213
+guesses            : 22
+search nodes       : 23
+backtracks         : 12
+solution unique    : yes
+
+=== Check ===
+solver found solution           : yes
+givens preserved                : yes
+rows complete                   : yes
+columns complete                : yes
+boxes complete                  : yes
+recorded placements replay legally: yes
+uniqueness check                : yes

package/examples/extra/output/transistor-switch.txt

@@ -0,0 +1,16 @@
+=== Answer ===
+In this toy transistor-switch model, a low input leaves the transistor OFF and a high input drives it ON in saturation.
+
+=== Reason Why ===
+low input state   : cutoff / OFF
+high input state  : saturation / ON
+high base current : 430 uA
+high collector Ic : 4800 uA
+load-limited Ic   : 4800 uA
+
+=== Check ===
+low input cutoff                : yes
+high input saturation           : yes
+switching states differ         : yes
+on-state current is load-limited: yes
+load voltage matches Ohm's law  : yes