这篇博客介绍了LeetCode周赛#104中的913题——猫和老鼠的博弈问题。在给定的无向图中，老鼠和猫交替移动，目标分别是到达0号洞穴和捕捉老鼠。文章详细解析了博弈的规则、结束条件，并探讨了在双方最优策略下，如何通过记忆化搜索来求解游戏结果，包括游戏可能的平局、老鼠胜利或猫胜利的情况。
题目来源：https://leetcode.com/contest/weekly-contest-104/problems/cat-and-mouse/
问题描述
913. Cat and Mouse
A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.
The graph is given as follows: graph[a] is a list of all nodes b such that ab is an edge of the graph.
Mouse starts at node 1 and goes first, Cat starts at node 2 and goes second, and there is a Hole at node 0.
During each player's turn, they must travel along one edge of the graph that meets where they are. For example, if the Mouse is at node 1, it must travel to any node in graph[1]
最低0.47元/天 解锁文章
扫一扫
2911
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
