擅长:python、mysql、java
<p>不要把迷宫想象成一维,即当前的位置(1,2,3,9),你应该把它想象成二维矩阵空间((0,0),(0,1))。你知道吗</p>
<p>我们不应该把基本迷宫硬编码为3,我们应该考虑nxnmaze,因为现在你已经实现了3x3的逻辑,现在你应该可以把它扩展到nxn</p>
<p>你用你的地图来处理可能的方向,我们应该写边界条件的逻辑,就像一个检查每一步可能的方向的方法</p>
<pre><code>def possible_path(current_x, current_y, matrix_size=3):
# this returns like directions possible like current_x + 1 < matrix_size
# then the east direction is possible.
pass
</code></pre>
<p>方向处理应该是这样的</p>
<pre><code> def position_handler(row, col, direction):
# can write the logic for mapping the direction to the movement in X and Y,
# if direction == 'NORTH'
# or can get the config from a map like,
# move = movement.get(direction)
# say NORTH config is =>movement= {'NORTH': {'x': 0, 'y':1}}
# and now move accordingly i.e
# row += move.get('x')
# col += move.get('y')
pass
</code></pre>