A robot is located at the top-left corner of a m x n grid
The robot is trying to reach the bottom-right corner of the grid, he can move randomly in any of the directions: up, down, left, right.
What is the expected steps for him to take before reaching the bottom right?
(Obviously the minimum steps for him to take is just : m+n, however he could move in any directions at any steps so this would complex things up... any thoughts? Possibly Markov Chains?)