[Feature,Example] Add MCTS algorithm and example

ghstack-source-id: 220d7ed
Pull Request resolved: pytorch#2796

Author: kurtamohler

examples/trees/mcts.py

@@ -0,0 +1,127 @@
+# Copyright (c) Meta Platforms, Inc. and affiliates.
+#
+# This source code is licensed under the MIT license found in the
+# LICENSE file in the root directory of this source tree.
+
+import time
+
+import torch
+import torchrl
+import torchrl.envs
+import torchrl.modules.mcts
+from tensordict import TensorDict
+
+pgn_or_fen = "fen"
+mask_actions = True
+
+env = torchrl.envs.ChessEnv(
+    include_pgn=False,
+    include_fen=True,
+    include_hash=True,
+    include_hash_inv=True,
+    include_san=True,
+    stateful=True,
+    mask_actions=mask_actions,
+)
+
+
+class TransformReward:
+    def __call__(self, td):
+        if "reward" not in td:
+            return td
+
+        reward = td["reward"]
+
+        if reward == 0.5:
+            reward = 0
+        elif reward == 1 and td["turn"]:
+            reward = -reward
+
+        td["reward"] = reward
+        return td
+
+
+# ChessEnv sets the reward to 0.5 for a draw and 1 for a win for either player.
+# Need to transform the reward to be:
+#   white win = 1
+#   draw = 0
+#   black win = -1
+transform_reward = TransformReward()
+env = env.append_transform(transform_reward)
+
+forest = torchrl.data.MCTSForest()
+forest.reward_keys = env.reward_keys
+forest.done_keys = env.done_keys
+forest.action_keys = env.action_keys
+
+if mask_actions:
+    forest.observation_keys = [f"{pgn_or_fen}_hash", "turn", "action_mask"]
+else:
+    forest.observation_keys = [f"{pgn_or_fen}_hash", "turn"]
+
+
+def tree_format_fn(tree):
+    td = tree.rollout[-1]["next"]
+    return [
+        td["san"],
+        td[pgn_or_fen].split("\n")[-1],
+        tree.wins,
+        tree.visits,
+    ]
+
+
+def get_best_move(fen, mcts_steps, rollout_steps):
+    root = env.reset(TensorDict({"fen": fen}))
+    mcts = torchrl.modules.mcts.MCTS(mcts_steps, rollout_steps)
+    tree = mcts(forest, root, env)
+    moves = []
+
+    for subtree in tree.subtree:
+        san = subtree.rollout[0]["next", "san"]
+        reward_sum = subtree.wins
+        visits = subtree.visits
+        value_avg = (reward_sum / visits).item()
+        if not root["turn"]:
+            value_avg = -value_avg
+        moves.append((value_avg, san))
+
+    moves = sorted(moves, key=lambda x: -x[0])
+
+    # print(tree.to_string(tree_format_fn))
+
+    print("------------------")
+    for value_avg, san in moves:
+        print(f" {value_avg:0.02f} {san}")
+    print("------------------")
+
+    return moves[0][1]
+
+
+for idx in range(30):
+    print("==========")
+    print(idx)
+    print("==========")
+    torch.manual_seed(idx)
+
+    start_time = time.time()
+
+    # White has M1, best move Rd8#. Any other moves lose to M2 or M1.
+    fen0 = "7k/6pp/7p/7K/8/8/6q1/3R4 w - - 0 1"
+    assert get_best_move(fen0, 40, 10) == "Rd8#"
+
+    # Black has M1, best move Qg6#. Other moves give rough equality or worse.
+    fen1 = "6qk/2R4p/7K/8/8/8/8/4R3 b - - 1 1"
+    assert get_best_move(fen1, 40, 10) == "Qg6#"
+
+    # White has M2, best move Rxg8+. Any other move loses.
+    fen2 = "2R3qk/5p1p/7K/8/8/8/5r2/2R5 w - - 0 1"
+    assert get_best_move(fen2, 600, 10) == "Rxg8+"
+
+    # Black has M2, best move Rxg1+. Any other move loses.
+    fen3 = "2r5/5R2/8/8/8/7k/5P1P/2r3QK b - - 0 1"
+    assert get_best_move(fen3, 600, 10) == "Rxg1+"
+
+    end_time = time.time()
+    total_time = end_time - start_time
+
+    print(f"Took {total_time} s")

torchrl/data/map/tree.py

@@ -1363,6 +1363,11 @@ def valid_paths(cls, tree: Tree):
     def __len__(self):
         return len(self.data_map)
 
+    def __contains__(self, root: TensorDictBase):
+        if self.node_map is None:
+            return False
+        return root.select(*self.node_map.in_keys) in self.node_map
+
     def to_string(self, td_root, node_format_fn=lambda tree: tree.node_data.to_dict()):
         """Generates a string representation of a tree in the forest.
 

torchrl/envs/custom/chess.py

@@ -222,12 +222,15 @@ def lib(cls):
         return chess
 
     _san_moves = []
+    _san_move_to_index_map = {}
 
     @_classproperty
     def san_moves(cls):
         if not cls._san_moves:
             with open(pathlib.Path(__file__).parent / "san_moves.txt", "r+") as f:
                 cls._san_moves.extend(f.read().split("\n"))
+            for idx, san_move in enumerate(cls._san_moves):
+                cls._san_move_to_index_map[san_move] = idx
         return cls._san_moves
 
     def _legal_moves_to_index(
@@ -255,7 +258,7 @@ def _legal_moves_to_index(
             board = self.board
 
         indices = torch.tensor(
-            [self._san_moves.index(board.san(m)) for m in board.legal_moves],
+            [self._san_move_to_index_map[board.san(m)] for m in board.legal_moves],
             dtype=torch.int64,
         )
         mask = None
@@ -409,7 +412,9 @@ def _reset(self, tensordict=None):
             if move is None:
                 dest.set("san", "<start>")
             else:
-                dest.set("san", self.board.san(move))
+                prev_board = self.board.copy()
+                prev_board.pop()
+                dest.set("san", prev_board.san(move))
         if self.include_fen:
             dest.set("fen", fen)
         if self.include_pgn:

torchrl/modules/mcts/__init__.py

@@ -0,0 +1,6 @@
+# Copyright (c) Meta Platforms, Inc. and affiliates.
+#
+# This source code is licensed under the MIT license found in the
+# LICENSE file in the root directory of this source tree.
+
+from .mcts import MCTS

torchrl/modules/mcts/mcts.py

@@ -0,0 +1,133 @@
+# Copyright (c) Meta Platforms, Inc. and affiliates.
+#
+# This source code is licensed under the MIT license found in the
+# LICENSE file in the root directory of this source tree.
+
+import torch
+import torchrl
+from tensordict import TensorDict, TensorDictBase
+from torch import nn
+
+from torchrl.data.map import MCTSForest, Tree
+from torchrl.envs import EnvBase
+
+
+class MCTS(nn.Module):
+    """Monte-Carlo tree search.
+
+    Attributes:
+        num_traversals (int): Number of times to traverse the tree.
+        rollout_max_steps (int): Maximum number of steps for each rollout.
+
+    Methods:
+        forward: Runs the tree search.
+    """
+
+    def __init__(
+        self,
+        num_traversals: int,
+        rollout_max_steps: int | None = None,
+    ):
+        super().__init__()
+        self.num_traversals = num_traversals
+        self.rollout_max_steps = rollout_max_steps
+
+    def forward(
+        self,
+        forest: MCTSForest,
+        root: TensorDictBase,
+        env: EnvBase,
+    ) -> Tree:
+        """Performs Monte-Carlo tree search in an environment.
+
+        Args:
+            forest (MCTSForest): Forest of the tree to update. If the tree does not
+                exist yet, it is added.
+            root (TensorDict): The root step of the tree to update.
+            env (EnvBase): Environment to performs actions in.
+        """
+        for action in env.all_actions(root):
+            td = env.step(env.reset(root.clone()).update(action))
+            forest.extend(td.unsqueeze(0))
+
+        tree = forest.get_tree(root)
+
+        tree.wins = torch.zeros_like(td["next", env.reward_key])
+        for subtree in tree.subtree:
+            subtree.wins = torch.zeros_like(td["next", env.reward_key])
+
+        for _ in range(self.num_traversals):
+            self._traverse_MCTS_one_step(forest, tree, env, self.rollout_max_steps)
+
+        return tree
+
+    def _traverse_MCTS_one_step(self, forest, tree, env, rollout_max_steps):
+        done = False
+        trees_visited = [tree]
+
+        while not done:
+            if tree.subtree is None:
+                td_tree = tree.rollout[-1]["next"].clone()
+
+                if (tree.visits > 0 or tree.parent is None) and not td_tree["done"]:
+                    actions = env.all_actions(td_tree)
+                    subtrees = []
+
+                    for action in actions:
+                        td = env.step(env.reset(td_tree).update(action))
+                        new_node = torchrl.data.Tree(
+                            rollout=td.unsqueeze(0),
+                            node_data=td["next"].select(*forest.node_map.in_keys),
+                            count=torch.tensor(0),
+                            wins=torch.zeros_like(td["next", env.reward_key]),
+                        )
+                        subtrees.append(new_node)
+
+                    # NOTE: This whole script runs about 2x faster with lazy stack
+                    # versus eager stack.
+                    tree.subtree = TensorDict.lazy_stack(subtrees)
+                    chosen_idx = torch.randint(0, len(subtrees), ()).item()
+                    rollout_state = subtrees[chosen_idx].rollout[-1]["next"]
+
+                else:
+                    rollout_state = td_tree
+
+                if rollout_state["done"]:
+                    rollout_reward = rollout_state[env.reward_key]
+                else:
+                    rollout = env.rollout(
+                        max_steps=rollout_max_steps,
+                        tensordict=rollout_state,
+                    )
+                    rollout_reward = rollout[-1]["next", env.reward_key]
+                done = True
+
+            else:
+                priorities = self._traversal_priority_UCB1(tree)
+                chosen_idx = torch.argmax(priorities).item()
+                tree = tree.subtree[chosen_idx]
+                trees_visited.append(tree)
+
+        for tree in trees_visited:
+            tree.visits += 1
+            tree.wins += rollout_reward
+
+    # TODO: Allow user to specify different priority functions with PR #2358
+    def _traversal_priority_UCB1(self, tree):
+        subtree = tree.subtree
+        visits = subtree.visits
+        reward_sum = subtree.wins
+
+        # If it's black's turn, flip the reward, since black wants to optimize for
+        # the lowest reward, not highest.
+        # TODO: Need a more generic way to do this, since not all use cases of MCTS
+        # will be two player turn based games.
+        if not subtree.rollout[0, 0]["turn"]:
+            reward_sum = -reward_sum
+
+        parent_visits = tree.visits
+        reward_sum = reward_sum.squeeze(-1)
+        C = 2.0**0.5
+        priority = (reward_sum + C * torch.sqrt(torch.log(parent_visits))) / visits
+        priority[visits == 0] = float("inf")
+        return priority