Skip to content

Test: Replace UniformTree with declarative MiniMaxTree#26

Merged
boraaros merged 1 commit into
mainfrom
test/minimax-tree-tests
Mar 25, 2026
Merged

Test: Replace UniformTree with declarative MiniMaxTree#26
boraaros merged 1 commit into
mainfrom
test/minimax-tree-tests

Conversation

@boraaros
Copy link
Copy Markdown
Owner

  • TreeNode: fluent DSL with Leaf(value), Goal(), Inner(children...)
  • TreePosition: self-loop on non-goal leaves so solver evaluates them as horizon nodes (uses position.Value) instead of terminal (always 0)
  • TreeRules: dummy legal step for non-goal leaves, empty for goals
  • 9 solver tests covering: basic minimax, symmetric values, equal branches, uneven branching, 4-level deep search, goal seeking/avoidance, negative values, forced single move
  • Removed UniformTreePosition and UniformTreeRules

…cture

- TreeNode: fluent DSL with Leaf(value), Goal(), Inner(children...)
- TreePosition: self-loop on non-goal leaves so solver evaluates them
  as horizon nodes (uses position.Value) instead of terminal (always 0)
- TreeRules: dummy legal step for non-goal leaves, empty for goals
- 9 solver tests covering: basic minimax, symmetric values, equal branches,
  uneven branching, 4-level deep search, goal seeking/avoidance,
  negative values, forced single move
- Removed UniformTreePosition and UniformTreeRules
@boraaros boraaros merged commit e0c64c0 into main Mar 25, 2026
1 check passed
@boraaros boraaros deleted the test/minimax-tree-tests branch March 25, 2026 07:36
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant