Reinforcement Learning

Heuristic Search and Reinforcement Learning Originally published in Chinese on 2020-12-10; this English edition preserves the original scope and technical context. The Pac-Man Projects are a course project in UC Berkeley CS 188, where we will use this project to illustrate heuristic search and reinforcement learning. 1 Blind Search Blind Search refers to search algorithms that do not utilize any additional information (input data or auxiliary functions) beyond the algorithm itself, such as BFS, DFS, Dijkstra, etc. ...