## Search Tree

Search states appear here as the DFS tree expands.

## Problem View

The problem world stays fixed while the replay highlights what DFS is doing.

## Explanation

initialise

ready

### Initial state

Loading trace data...

Current path cost 0.000
Best cost none
Solutions found 0
Pruned branches 0

## Controls

Example
Tokeniser
Learning corpus
BPE merges
Context window
Problem mode
Mode
Labyrinth size
Seed Playback speed
Variable order
Algorithm
Variable ordering
Value ordering
Number of colours
Lower-left view
Show explored edges Show pruned branches
Use unit propagation Use pure literals
Show planner trace
Show true location
Show domains on world
Current step
0 / 0
Current branch
Best so far
Final path
Pruned branch
Current route
Dead end
Final path
Wall
Current route
Explored edge
Dead end
Final path
Active branch
Forced assignment
Contradiction
Solution / entailment
Current focus
Reduced domain
Domain wipe-out
Assigned value
Most likely room
Belief mass
True location
Noisy cue

Copyright 2026 UNSW. Author: Oliver Obst <o.obst@unsw.edu.au>. Released under GNU GPL v3.