一个正方形平面被分为N*N个单元格，其周围被墙包围，其中有一个滑块和一个坑，单

元格之间可能存在墙。每次操作可以将滑块往上下左右中的某一个方向滑动，滑块被滑动后会朝滑动方向不断移动直到遇到墙或者掉入坑中为止。问最少滑动多少次能将滑块滑到坑中-Plane is divided into a square cell of N* N, which is surrounded by the surrounding wall, which has a slider and a pit, a single

There may be a wall between the yuan grid. You can slide up and down in one direction around the slide, the slider is sliding toward the sliding direction will continue to move until it hits a wall or fall into the pit so far each operation. Q. How many times can at least slide slide slide pit