我正在尝试构建一些python脚本,如果有人从x位置开始下棋,它可以勾勒出棋局中可用的招式。我目前的代码如下:
import argparse, json
chessBoard = [[1, 1, 1, 1, 1, 1, 1, 1] for i in range(8)]
chess_map_from_alpha_to_index = {
"b" : 0,
"c" : 1,
"d" : 2,
"e" : 3,
"f" : 4,
"g" : 5,
"h" : 6,
"i" : 7
}
chess_map_from_index_to_alpha = {
0: "b",
1: "c",
2: "d",
3: "e",
4: "f",
5: "g",
6: "h",
7: "i"
}
def getRookMoves(pos, chessBoard):
column, row = list(pos.strip().lower())
row = int(row) - 1
column = chess_map_from_alpha_to_index[column]
i,j = row, column
solutionMoves = []
# Compute the moves in Rank
for j in xrange(8):
if j != column:
solutionMoves.append((row, j))
# Compute the moves in File
for i in xrange(8):
if i != row:
solutionMoves.append((i, column))
solutionMoves = ["".join([chess_map_from_index_to_alpha[i[1]], str(i[0] + 1)]) for i in solutionMoves]
solutionMoves.sort()
return solutionMoves
def getKnightMoves(pos, chessBoard):
""" A function that returns the all possible moves
of a knight stood on a given position
"""
column, row = list(pos.strip().lower())
row = int(row) - 1
column = chess_map_from_alpha_to_index[column]
i,j = row, column
solutionMoves = []
try:
temp = chessBoard[i - 6][j + 1]
solutionMoves.append([i - 6, j + 1])
except:
pass
try:
temp = chessBoard[i - 3][j + 2]
solutionMoves.append([i - 3, j + 2])
except:
pass
try:
temp = chessBoard[i - 5][j + 3]
solutionMoves.append([i - 5, j + 3])
except:
pass
try:
temp = chessBoard[i - 7][j + 4]
solutionMoves.append([i - 7, j + 4])
except:
pass
try:
temp = chessBoard[i - 1][j + 5]
solutionMoves.append([i - 1, j + 5])
except:
pass
try:
temp = chessBoard[i - 4][j + 6]
solutionMoves.append([i - 4, j + 6])
except:
pass
try:
temp = chessBoard[i - 2][j + 7]
solutionMoves.append([i - 2, j + 7])
except:
pass
# Filter all negative values
temp = [i for i in solutionMoves if i[0] >=0 and i[1] >=0]
allPossibleMoves = ["".join([chess_map_from_index_to_alpha[i[1]], str(i[0] + 1)]) for i in temp]
allPossibleMoves.sort()
return allPossibleMoves
parser = argparse.ArgumentParser()
parser.add_argument("-p", "--piece", help="chess piece name: ex- rook, knight, pawn etc")
parser.add_argument("-l", "--location", help="chess notation string: ex- E4, D6 etc")
args = parser.parse_args()
piece = args.piece.strip().lower()
location = args.location.strip()
# According to the type of piece adjust function
if (piece == "rook"):
print (json.dumps({"piece":piece,
"current_location": location,
"moves": getRookMoves(location, chessBoard)}))
elif (piece == "knight"):
print (json.dumps({"piece":piece,
"current_location": location,
"moves": getKnightMoves(location, chessBoard)}))
不过,在理想情况下,我想保留if-elifjson.dumps文件但修改try:
temp = chessBoard[i - 5][j + 3]
solutionMoves.append([i - 5, j + 3])
except:
pass
所以这也变成了if语句。因此,如果一个人在python中键入主.py-p“knight”-l“b8”然后代码读取'temp=chessBoard[i-5][j+3] 解决方案移动.append([i-5,j+3]) 除了: 通过``
将b8作为一个位置,并根据它输出一个答案。你知道吗
希望这是有道理的。感谢你在这里给予的帮助。你知道吗
你只是在确认这一举动不会让你脱离董事会吗?你可以这样做:
虽然我可能遗漏了一些东西,但你可能想看看这个: How do I generate all of a knight's moves?
您依赖于
list index out of range
异常来触发try代码。如果您后退一步并思考为什么会抛出该异常,您可以将其重新工作到所需的If语句中。发生此异常是因为其中一个索引大于棋盘中的列表。你的棋盘在任何一个方向都是8个项目,所以你可以只检查0和8:以前必须有额外的负筛选器的原因是负值是列表的有效索引值。不过,你可以马上把它们处理掉。你知道吗
您可能需要考虑创建一个您正在检查的所有案例的列表(例如(-6,1)、(-3,2)等),并将其嵌入if check for循环中,以减少代码重复。像这样:
相关问题 更多 >
编程相关推荐