You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Jul 16, 2024. It is now read-only.
I just had a question related to how the depth limit of a subgame is determined.
This seems to be something I can't quite figure out.
Is it always a depth-limit of 1?
I was wondering if you might be able to enlighten me on how exactly the depth limit of subgames for Pluribus gets determined during real-time search and wherein the literature I could find this information?
Thanks in advance
The text was updated successfully, but these errors were encountered:
I have no idea how this particular software implements it, but the Pluribus paper references this other research paper about depth-limited solving for imperfect information games.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hi guys
I just had a question related to how the depth limit of a subgame is determined.
This seems to be something I can't quite figure out.
Is it always a depth-limit of 1?
I was wondering if you might be able to enlighten me on how exactly the depth limit of subgames for Pluribus gets determined during real-time search and wherein the literature I could find this information?
Thanks in advance
The text was updated successfully, but these errors were encountered: