我正在尝试构建一个Python类型为int的矩阵,即64位有符号整数。
我不能使用Python long类型,但我不知道如何正确地转换为64位整数。 更新 好的。我相当确定我正确地使用了Cython。我编写的代码是用于在围棋/黑白棋游戏中进行极大极小搜索。
到目前为止,最常调用的函数是这些:
cdef matrix33():
return np.zeros((3,3),dtype=int)
cdef do_stuf(np.ndarray[int, ndim=2] matrix):
...
return some_value
def start():
print do_stuf(matrix33())
代码编译没有问题,但当我运行时一直遇到这个错误:
ValueError: Buffer dtype mismatch, expected 'int' but got 'long'
我不能使用Python long类型,但我不知道如何正确地转换为64位整数。 更新 好的。我相当确定我正确地使用了Cython。我编写的代码是用于在围棋/黑白棋游戏中进行极大极小搜索。
到目前为止,最常调用的函数是这些:
cdef isThere_greedy_move(np.ndarray[np.int64_t, ndim=2]board, int player):
cdef int i, j
for i in xrange(len(board)):
for j in xrange(len(board)):
if board[i,j] == 0:
board[i,j] = player
if player in score(board):
board[i,j] = 0
return True
board[i,j] = 0
return False
# main function of the scoring system.
# returns list of players that eat a stone
cdef score(np.ndarray[np.int64_t, ndim=2] board):
scores = []
cdef int i,j
cdef np.ndarray[np.int64_t, ndim = 2] checked
checked = np.zeros((board.shape[0], board.shape[1]), dtype = int)
for i in xrange(len(board)):
for j in xrange(len(board)):
if checked[i,j] == 0 and board[i,j] !=0:
life, newly_checked = check_life(i,j,board,[])
if not life:
if -board[i,j] not in scores:
scores.append(-board[i,j])
if len(scores) == 2:
return scores
checked = update_checked(checked, newly_checked)
return scores
# helper functions of score/1
cdef check_life(int i, int j, np.ndarray[np.int64_t, ndim=2] board, checked):
checked.append((i,j))
if liberty(i,j,board):
return True, checked
for pos in [[1,0],[0,1],[-1,0],[0,-1]]:
pos = np.array([i,j]) + np.array(pos)
if check_index(pos[0],pos[1],len(board)) and board[pos[0],pos[1]] == board[i,j] and (pos[0],pos[1]) not in checked:
life, newly_checked = check_life(pos[0],pos[1],board,checked)
if life:
checked = checked + newly_checked
return life, checked
return False, [] # [] is a dummy.
cdef liberty(int i,int j, np.ndarray[np.int64_t, ndim=2] board):
for pos in [np.array([1,0]),np.array([0,1]),np.array([-1,0]),np.array([0,-1])]:
pos = np.array([i,j]) - pos
if check_index(pos[0],pos[1],len(board)) and board[pos[0],pos[1]] == 0:
return True
return False
我本来以为这是Cython大放异彩的机会。
要解决3x3的Capture Go问题:
Python 2.7花费了2.28秒,而使用Cython稳定在2.03秒。
两者都是用python时间模块测试的,在低于60°C的i7处理器上测试。
现在对我来说问题是,我是否要转而使用Haskell或C++来完成这个项目...