The TSTOEAO Go Engine

The TSTOEAO Go Engine

DOI: To be assigned.

John Swygert

July 8, 2026

Abstract

The game of Go is not merely a board game. It is a visible model of boundary conditions, unresolved relation, route-space, encoded history, strategic phase change, and future-state constraint. Existing Go engines, including AlphaGo and AlphaGo Zero, demonstrated that neural networks, reinforcement learning, self-play, and tree search can exceed human strategic performance. This paper proposes a further conceptual layer: a TSTOEAO Go engine that evaluates not merely moves, probabilities, territory, or expected value, but the route-space by which a future board becomes recorded. The central claim is that a game state is not merely a position. It is a structured field of available routes into future recorded states. A TSTOEAO-equipped system would evaluate how each move alters boundary conditions, preserves or reduces route-space, forces or prevents phase change, and constrains the opponent’s future paths. This paper also argues that the same route-space logic applies beyond Go, including metamaterials, phase-boundary research, logistics, war-gaming, AI planning, and decision theory.

01 Purpose

The purpose of this paper is to propose a TSTOEAO interpretation of strategic intelligence through the game of Go.

Go is an unusually powerful model because every move becomes recorded history. A stone placed on the board cannot be unplayed in the normal course of the game. Each move changes the available future. Each boundary changes the field. Each group exists in a state of potential life, death, influence, threat, or transformation until the route-space around it becomes resolved.

In this sense, Go is not simply a contest of territory.

Go is a contest over future route-space.

The central claim is:

A game state is not merely a position. It is a structured field of available routes into recorded future states.

02 AlphaGo and the Existing Breakthrough

AlphaGo demonstrated that neural networks combined with tree search could evaluate Go at a level beyond human champions. AlphaGo Zero later demonstrated that a system could become stronger by learning only from the rules and self-play, without relying on human expert games.

These breakthroughs were enormous.

But TSTOEAO asks a different question:

What if the engine does not merely search the possible future?

What if the engine evaluates the structure by which the future becomes available, constrained, forced, routed, or recorded?

This is not a rejection of AlphaGo-style systems. It is a proposed extension of strategic interpretation.

An AlphaGo-style engine asks:

Which move has the strongest expected value?

A TSTOEAO Go engine asks:

Which move most favorably alters the route by which the future board can become recorded?

03 Go as Encoded History

A Go board is a field of recorded decisions.

Each stone is encoded history.

Each group is accumulated structure.

Each liberty is available route-space.

Each cut is a boundary-forced event.

Each connection preserves route-space.

Each capture collapses route-space.

Each ko is unresolved relation under rule-bound recurrence.

Each ladder is routed inevitability.

Each life-and-death problem is a phase-boundary problem.

Each territory is stabilized physical history within the game-space.

This is why Go is such a powerful model for TSTOEAO.

The board visibly converts possibility into history.

04 Route-Space Mathematics

The basic TSTOEAO strategic equation is:

Advantage = player route-space preserved - opponent route-space preserved

Or symbolically:

A = Rp - Ro

Where:

A = strategic advantage

Rp = player’s viable future route-space

Ro = opponent’s viable future route-space

This is not enough by itself, because route-space does not exist equally everywhere. Route-space depends on boundary strength.

So the next form is:

A = (Rp x Bp) - (Ro x Bo)

Where:

Bp = strength of player-controlled boundary conditions

Bo = strength of opponent-controlled boundary conditions

This still is not complete, because some routes are temporary while others are durable. Therefore, encoded stability must be included.

A = (Rp x Bp x Ep) - (Ro x Bo x Eo)

Where:

Ep = player’s encoded stability

Eo = opponent’s encoded stability

This gives a first structural evaluation grammar:

Strategic advantage is the difference between the player’s durable route-space under boundary control and the opponent’s durable route-space under boundary control.

05 The Life Threshold

In Go, a group is alive when it has sufficient route-space for self-stabilization. A group is dead when its available route-space falls below what is required to stabilize itself.

The life threshold may be expressed as:

Rg >= Sg

Where:

Rg = a group’s remaining viable route-space

Sg = the group’s minimum stabilization requirement

If:

Rg < Sg

then the group is entering collapse unless an external intervention restores route-space, changes the boundary, or forces a compensating threat elsewhere.

This gives a clean TSTOEAO definition of life and death in Go:

Life is sufficient route-space for durable self-stabilization.

Death is route-space collapse below the stabilization threshold.

06 Sente, Gote, and Route-Control

In ordinary Go language, sente means initiative. Gote means losing initiative or answering.

TSTOEAO describes this more structurally.

Sente is route-control.

Gote is route-forced response.

A player has sente when their move controls the opponent’s next route. A player is in gote when the opponent’s prior move has narrowed the player’s route-space so sharply that a response becomes necessary.

Thus:

Sente = the power to define the opponent’s next route-space.

Gote = the condition of responding inside a route-space already constrained by the opponent.

A TSTOEAO Go engine would therefore value not merely points gained, but future route-control created.

07 Thickness, Influence, and Stored Future Routing Power

In Go, thickness and influence often confuse weaker players because they do not immediately appear as territory.

TSTOEAO clarifies this.

Thickness is stored future-routing power.

Influence is gradient pressure before it becomes territory.

A thick position does not merely occupy space. It changes what routes are available later. It makes some opponent futures expensive, unstable, or impossible. It makes some player futures easier, safer, and more durable.

Therefore:

Territory is recorded value.

Influence is unresolved route-pressure.

Thickness is durable boundary strength.

A TSTOEAO Go engine would evaluate influence not as vague potential, but as route-space deformation.

08 Sacrifice as Route Exchange

A sacrifice in Go is not necessarily loss. It may be the deliberate surrender of local route-space in order to gain stronger global route-control.

TSTOEAO defines sacrifice as:

The intentional conversion of local encoded loss into larger route-space advantage.

A weak engine may evaluate sacrifice as lost material.

A stronger engine evaluates whether the sacrifice changes the future route architecture.

The question is not:

What did I lose?

The question is:

What future routes did the loss purchase?

09 Strategic Phase Change

Many Go positions remain unresolved for long stretches. Then one move changes everything.

A weak group becomes dead.

A moyo becomes territory.

An invasion becomes alive.

A connection becomes impossible.

A ko threat changes the entire board.

This is strategic phase change.

A strategic phase change occurs when the route-space of the board crosses a threshold after which the future state becomes qualitatively different.

Before the threshold, multiple futures remain available.

After the threshold, the board begins resolving toward a new recorded condition.

The TSTOEAO Go engine would search for these thresholds.

It would not merely ask which move improves the score.

It would ask:

Which move pushes the board across a phase boundary?

Which move prevents the opponent from crossing one?

Which move preserves unresolved relation until it can be routed advantageously?

Which move prematurely records a weak future?

10 The Quantum Go Engine

A quantum computer should not be described carelessly as magically seeing all futures at once in a usable way. Quantum computation does not automatically produce omniscience. But a properly designed hybrid system may search, sample, optimize, or represent certain kinds of state-space differently than classical systems.

The TSTOEAO proposal is that a quantum-enhanced Go engine should not merely search more branches.

It should search better-structured branches.

A quantum Go engine equipped only with raw search power may examine vast possibility-space.

A TSTOEAO-equipped quantum Go engine would evaluate which possibilities are structurally available, boundary-constrained, phase-sensitive, route-preserving, and likely to become recorded advantage.

The advantage would not be merely computational speed.

The advantage would be route-aware evaluation.

A conventional system may ask:

Which future is most probable?

A TSTOEAO quantum system would ask:

Which future route-space can be made most favorable by this move?

11 The Strongest Move

The strongest move is not always the move that gains the most immediate territory.

The strongest move is the move that most favorably alters the route by which the future board can become recorded.

This is the core strategic claim of the paper.

A move is powerful when it changes future route-space.

A move is weak when it records value while surrendering future route-space.

A move is dangerous when it creates hidden boundary instability.

A move is profound when it appears small but changes the routes by which the entire board can resolve.

Thus:

The best move is not merely the highest-value move.

The best move is the move that most favorably routes the future.

12 Application to Metamaterials and Phase Boundaries

The same principle applies outside Go.

In metamaterials and phase-boundary research, a system does not merely change because a gradient exists. It changes according to the route by which the gradient is permitted or forced to resolve.

A material near phase change may contain multiple available futures.

The final state depends on boundary conditions, defects, interfaces, fields, stress, temperature, timing, pressure, charge, lattice geometry, and route accessibility.

A TSTOEAO research system would therefore ask:

Where is the unresolved relation?

Where is the phase boundary?

What gradient is seeking resolution?

What routes are physically available?

Which boundary condition controls the crossing?

Which route produces stable function?

Which route produces collapse, disorder, or unwanted transformation?

Which intermediate state can be preserved?

Which small boundary intervention changes the final recorded state?

This is directly parallel to Go.

In Go, a group may be alive, dead, unsettled, attackable, sacrificable, or influential depending on route-space.

In a material, a structure may be stable, unstable, metastable, transformable, recoverable, or functionally useful depending on route-space.

The board and the material are different domains, but the grammar is the same:

possibility → gradient → boundary condition → routed crossing → encoded history

13 How to Search Phase-Boundary Systems

A TSTOEAO-equipped laboratory method would search not only for final phases, but for the routes by which final phases become reachable.

The researcher should look for:

boundary instability before bulk transition,

defect sites that initiate transformation,

interfaces where competing regimes meet,

fields or pressures that alter route availability,

metastable states that persist under constrained crossing,

local regions where gradient flattening begins before the whole system changes,

and small interventions that redirect the crossing path.

The key laboratory question becomes:

Which boundary condition determines the route into the next recorded state?

This is different from asking only what the final state is.

The final state is the record.

The route is the explanation.

14 Strategic Planning and Real-Time Decision Updating

The same route-space logic applies to planning, logistics, and war-gaming in the broad strategic sense.

A decision system should not merely project one expected future. It should continuously update the available route-space as real information arrives.

After each day, each event, each move, each loss, each gain, or each change in conditions, the system should ask:

What route-space remains?

What route-space has been lost?

What boundary conditions have changed?

What phase thresholds are approaching?

What action preserves the most future stability?

What action constrains the opponent’s future routes?

What action should not be taken because inaction preserves better route-space?

This last point matters.

Not moving is also a move.

In Go, passing or delaying can preserve route-space under the right conditions.

In strategy, refusing to act can sometimes prevent premature encoding of a bad future.

A TSTOEAO decision engine therefore evaluates both action and non-action as route-altering events.

15 The Predictive Edge

The predictive edge of this framework is not that it knows the future in a mystical sense.

The predictive edge is that it identifies the structure by which futures become available or unavailable.

This matters because many systems fail by focusing on force rather than route.

They ask:

How much power do we have?

But the better question is:

Which route does our power actually open?

They ask:

What is the likely outcome?

But the better question is:

Which boundary condition will determine the outcome?

They ask:

What move gains the most now?

But the better question is:

What move most favorably constrains future route-space?

This is why a TSTOEAO-equipped system could outperform an otherwise comparable system.

It would not merely calculate harder.

It would see the structure of becoming more clearly.

16 Game Theory and Decision Theory

Game theory studies strategic interaction among decision-makers.

Decision theory studies the selection of actions under uncertainty, preference, consequence, and available information.

TSTOEAO adds route-space grammar to both.

In game theory, the opponent is not merely another utility-maximizing agent. The opponent is a route-altering force.

In decision theory, a decision is not merely a choice among outcomes. A decision is a boundary-forced encoding event that changes which futures remain available.

Thus:

A decision is not only a selection.

A decision is a route-space transformation.

This is why Go is such a perfect test case.

Every move selects a future while destroying other futures.

Every move is a decision that becomes history.

Every move changes the route-space of both players.

17 The TSTOEAO Engine

A TSTOEAO engine would evaluate a position through layered questions.

First:

What is already encoded?

Second:

What remains unresolved?

Third:

Where are the active boundaries?

Fourth:

Which gradients are seeking resolution?

Fifth:

Which routes are available?

Sixth:

Which routes are being forced?

Seventh:

Which routes are being hidden?

Eighth:

Which move changes the opponent’s future route-space most severely?

Ninth:

Which move preserves the player’s route-space most durably?

Tenth:

Which move risks premature encoding of a weak future?

This is not merely a Go engine.

It is a decision engine.

18 General Formula

The general TSTOEAO route-space formula may be written:

F = (R x B x E x T) - C

Where:

F = future-state advantage

R = available route-space

B = boundary control

E = encoded stability

T = timing advantage

C = crossing cost

For two-player strategic systems:

A = [(Rp x Bp x Ep x Tp) - Cp] - [(Ro x Bo x Eo x To) - Co]

Where:

A = net strategic advantage

p = player

o = opponent

This formula is not intended as a complete algorithm. It is a mathematical grammar for evaluating strategic transformation.

The algorithm comes later.

The grammar comes first.

19 Why This Matters

This framework matters because many systems become more understandable when viewed as route-space problems.

Go becomes route-space struggle.

Quantum measurement becomes boundary-forced encoding.

Time becomes embodied passage through routed resolution.

Metamaterials become phase-route systems.

AI planning becomes future-route optimization.

Logistics becomes route preservation under constraint.

War-gaming becomes adversarial route-space control.

Medicine becomes bodily boundary interpretation.

Civic reform becomes institutional route redirection.

The same grammar does not erase domain differences. It reveals structural similarity.

20 Conclusion

The TSTOEAO Go engine begins with a simple claim:

A game state is not merely a position. It is a structured field of available routes into recorded future states.

A stone is encoded history.

A group is route-space under boundary pressure.

A move is a boundary intervention.

A capture is route-space collapse.

A sacrifice is route exchange.

Sente is route-control.

Thickness is stored future-routing power.

Influence is unresolved route-pressure.

Life is sufficient route-space for durable self-stabilization.

Death is route-space collapse below the stabilization threshold.

The strongest move is not always the move that gains the most immediate territory.

The strongest move is the move that most favorably alters the route by which the future board can become recorded.

This principle applies beyond Go.

It applies to metamaterials, phase transitions, quantum systems, strategic planning, AI, logistics, decision theory, and any system where unresolved relation becomes recorded history through boundary conditions.

The future is not merely found.

The future is routed.

References

Silver, David, et al. “Mastering the Game of Go with Deep Neural Networks and Tree Search.” Nature, 2016.

Silver, David, et al. “Mastering the Game of Go Without Human Knowledge.” Nature, 2017.

Finet, Yohan, Yves Bérubé-Lauzière, and Victor Drouin-Touchette. “Quantum-Enhanced Monte Carlo Tree Search Framework for Combinatorial Optimization Problems.” arXiv, 2026.

Wang, Pei-Yong, Muhammad Usman, Udaya Parampalli, Lloyd C. L. Hollenberg, and Casey R. Myers. “Automated Quantum Circuit Design with Nested Monte Carlo Tree Search.” arXiv, 2022.