Minimum Path Cost in a Hidden Grid

You must navigate and discover a hidden grid using only local movement/cost queries from a start cell, reconstructing reachable cells and obstacles as you explore, then compute the minimum total cost to reach the target via adjacent moves. The core challenge is combining exploration of an unknown graph (limited visibility and queries) with a shortest-path algorithm (e.g., Dijkstra) on the discovered map.