Bellman equation

The Bellman equation, named after Richard Bellman, is a recursive formula used to solve dynamic programming problems. It breaks down a decision problem into smaller subproblems, solving each one to find the optimal policy or decision path. In the context of reinforcement learning, it helps determine the value of a state under a particular policy by considering the expected return of taking an action and then following the policy.