Python 棋子移动游戏

AdamShyly

已于 2022-06-29 01:02:37 修改

阅读量670

点赞数

分类专栏：数据结构与算法文章标签：算法

于 2022-06-29 00:01:21 首次发布

本文链接：https://blog.csdn.net/Adam_captain/article/details/125512163

版权

数据结构与算法专栏收录该内容

20 篇文章 2 订阅

订阅专栏

def initChess(a, n):  # 1是白棋 2是黑棋
    for i in range(n):
        a[i] = 1
    for i in range(n, n * 2):
        a[i] = 2
    a[n * 2] = 0
    a[n * 2 + 1] = 0
    

def move(a, m, n):
    a[n] = a[m]
    a[m] = 0


def chess(a, n):
    if n == 1:
        move(a, 0, 2)
        move(a, 1, 3)
        return
    move(a, n - 1, n * 2)
    move(a, n, n * 2 + 1)
    move(a, n * 2 - 1, n - 1)
    move(a, n * 2 - 2, n)
    chess(a, n - 1)
    
n = 4
a = [0] * ((n + 1) * 2)
initChess(a, n)
chess(a, n)
print(a)