Repository navigation
Implement deterministic ID hashing for MCTS transposition detection - #19
Merged
REX-codebase merged 1 commit intoJun 22, 2026
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Overview
This PR replaces the legacy timestamp and random-based ID generation in the Monte Carlo Tree Search (MCTS) engine with a deterministic, content-based hashing approach. This transition enables the engine to recognize "transpositions"—identical design states reached via different mutation paths.
The "Why" (Rationale)
The previous implementation used
Date.now()andMath.random()to generate IDs. This caused a significant efficiency bottleneck:evaluationCachecould not be leveraged across different branches of the search tree because IDs never collided, even when the underlying data did.By implementing deterministic hashing, we ensure that the system recognizes when it has encountered a state before, allowing for instant score retrieval and a higher volume of unique design explorations within the same time budget.
Key Changes
DesignStatewith SHA-256 hashes using Node'scryptomodule. The hash is generated from a stable serialization of design properties (colors, typography, layout, etc.).evaluationCacheusing the new deterministic ID before invoking auditors.skills/utils/test-mcts-hash.js) to verify:Constraints & Guardrails