##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Grid counting principles)
Grid path counting uses 2D DP where each cell depends on its neighbors.
When counting paths, sum the ways to reach each incoming state.
Base cases (edges of the grid) need special initialization.
This pattern extends to grids with obstacles. Let me show you.
