我开始使用python的命令行象棋。我设法创建了一个像这样的表:
def setup_grid():
grid = [[' ' for i in range(gridsize)] for i in range(gridsize)] # Creates a grid of 0 of the size set by user
return(grid)
# Displaying the grid to the user
def show_grid(grid):
gridsize = len(grid)
horizontal = ' '+4*gridsize*'-'+'-' # This prints the horizontal borders of the grid
#####################################################
toplabel = ' ' #
for i in string.ascii_lowercase[:gridsize]: # This creates the letters according
toplabel = toplabel+i+' ' # to how big the grid is. This prints the top letters
print '\n'+toplabel+'\n'+horizontal #
#####################################################
#########################################
for idx,i in enumerate(grid): #
row = '{0:2} |'.format(idx+1) #
for j in i: # This creates the numbers
row = row+' '+j+' |' # for the left side of the grid
print row+'\n'+horizontal #
print '' #
#########################################
def play_game():
gridsize = 8
currgrid = [[' ' for i in range(gridsize)] for i in range(gridsize)]
show_grid(currgrid)
grid = []
play_game()
现在我正在尝试为白皇后定义像wq
这样的作品。
玩家选择移动哪一块的方式是选择网格上的坐标并移动输入新坐标的棋子。我不知道的是如何确保碎片按要求移动。我不知道如何验证他们的动作。
答案 0 :(得分:0)
移动验证有点复杂,但是,下面是如何验证女王移动的可能性。首先,您可能希望将游戏布局移动到一个类,以便更简单的棋盘和棋子访问。然后,创建一个移动片段的方法。该方法可以由装饰器包装,该装饰器将验证传递给方法的坐标:
def validate_move(f):
def wrapper(cls, name, x, y):
methods = {'q':cls.__class__.queen_moves} #build dictionary of move accumulators
full_moves = list(methods[name[:-1]](getattr(cls, 'board'), color = name[-1]))
if [x, y] not in full_moves:
print("invalid move")
else:
f(cls, x, y)
return wrapper
class Chess:
pieces = [['r', 'kn', 'b', 'k', 'q', 'b', 'kn', 'r'], ['p']*8]
def __init__(self):
self.board = [[i+'b' for i in b] for b in Chess.pieces]+([['-']*8]*8)+[[i+'w' for i in b] for b in Chess.pieces]
@validate_move
def move_piece(_name, x, y):
a1, b1 = [(i, b) for i in range(8) for b in range(8) if self.board[i][b] == _name]
self.board[x][y] = _name
self.board[a1][b1] = '-'
@staticmethod
def queen_moves(board, color = 'w'):
c1, c2 = [(i, b) for i in range(8) for b in range(8) if board[i][b] == 'q'+color]
_c2, _c1 = c2, c1
while c2 < 8: #check vertically
c2 += 1
if board[c1][c2] != '-':
c2 = _c2
break
yield [c1, c2]
while c2 >= 0: #check vertically
c2 -= 1
if board[c1][c2] != '-':
c2 = _c2
break
yield [c1, c2]
while c1 < 8: #check horizontally
c1 += 1
if board[c1][c2] != '-':
c1 = _c1
break
yield [c1, c2]
while c1 >= 0: #check horizontally
c1 -= 1
if board[c1][c2] != '-':
c1 = _c1
break
yield [c1, c2]
因此,您还有两件事要做:
创建staticmethod
s的完整列表,以获取所有棋子的全部动作。
在methods
中构建wrapper
字典以存储移动查找程序功能对象。