-
Notifications
You must be signed in to change notification settings - Fork 8
[WIP | Need Fix + Add Websocket] Add reflective-mcts #42
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
The latest updates on your projects. Learn more about Vercel for Git ↗︎
|
@SyHeee thanks for the PR, but actually simple search agent only contains BFS and DFS, you will need to configure another MCTS agent for MCTS. |
Do you suggest create a new MCTS class? For the simplified version, as in my method, i didn't use UCT and explicit rollout for searching and selection, my design was to leverage current Node and state to do simulation and selecting among candidates. Hence I added the logic under simple_search_agent. Lemme know your thoughts. |
Hi Shiying, yes, I suggest you create another MCTS agent class, and you can copy paste some code from the simple tree search agent to the new class, later we can do some refactoring to have a base class and both MCTS agent and simple tree search agent inherit that, but we can do that later. |
Got it, sure I will create a new module and keep the overlapped methods. |
merged this PR: #57 |
Simplified MCTS --> Reflective MCTS (R-MCTS)
Expansion: This phase remains similar to BFS/DFS, expanding the selected node if it's not terminal and hasn't reached max depth.
Simulation: Uses the existing trajectory scoring system to evaluate the current path, which provides: