编一个python程序实现五子棋博弈系统，采用至少两种方法（如极大极小过程、α-β过程）设计五子棋博弈系统；

以下是一个使用极大极小算法实现的五子棋博弈系统：

import random

# 初始化棋盘
def init_board():
    board = []
    for i in range(15):
        row = ["+" for j in range(15)]
        board.append(row)
    return board

# 打印棋盘
def print_board(board):
    for i in range(15):
        row = ""
        for j in range(15):
            row += board[i][j] + " "
        print(row)

# 判断胜负
def check_win(board):
    # 判断横向是否有五个连续棋子
    for i in range(15):
        for j in range(11):
            if board[i][j] != "+" and board[i][j] == board[i][j+1] == board[i][j+2] == board[i][j+3] == board[i][j+4]:
                return board[i][j]

    # 判断纵向是否有五个连续棋子
    for i in range(11):
        for j in range(15):
            if board[i][j] != "+" and board[i][j] == board[i+1][j] == board[i+2][j] == board[i+3][j] == board[i+4][j]:
                return board[i][j]

    # 判断左斜向是否有五个连续棋子
    for i in range(11):
        for j in range(11):
            if board[i][j] != "+" and board[i][j] == board[i+1][j+1] == board[i+2][j+2] == board[i+3][j+3] == board[i+4][j+4]:
                return board[i][j]

    # 判断右斜向是否有五个连续棋子
    for i in range(11):
        for j in range(4, 15):
            if board[i][j] != "+" and board[i][j] == board[i+1][j-1] == board[i+2][j-2] == board[i+3][j-3] == board[i+4][j-4]:
                return board[i][j]

    # 如果没有胜者，则返回平局
    for i in range(15):
        for j in range(15):
            if board[i][j] == "+":
                return None
    return "Draw"

# 计算得分
def calculate_score(board, player):
    score = 0

    # 判断横向是否有连续的棋子
    for i in range(15):
        for j in range(11):
            if board[i][j] == player and board[i][j+1] == player and board[i][j+2] == player and board[i][j+3] == player and board[i][j+4] == player:
                score += 100

    # 判断纵向是否有连续的棋子
    for i in range(11):
        for j in range(15):
            if board[i][j] == player and board[i+1][j] == player and board[i+2][j] == player and board[i+3][j] == player and board[i+4][j] == player:
                score += 100

    # 判断左斜向是否有连续的棋子
    for i in range(11):
        for j in range(11):
            if board[i][j] == player and board[i+1][j+1] == player and board[i+2][j+2] == player and board[i+3][j+3] == player and board[i+4][j+4] == player:
                score += 100

    # 判断右斜向是否有连续的棋子
    for i in range(11):
        for j in range(4, 15):
            if board[i][j] == player and board[i+1][j-1] == player and board[i+2][j-2] == player and board[i+3][j-3] == player and board[i+4][j-4] == player:
                score += 100

    return score

# 极大极小算法
def minimax(board, depth, alpha, beta, is_maximizing):
    # 如果达到搜索深度或者游戏结束，则返回得分
    result = check_win(board)
    if depth == 0 or result != None:
        if result == "X":
            return (None, 100000000)
        elif result == "O":
            return (None, -100000000)
        else:
            return (None, 0)

    # 如果是极大节点
    if is_maximizing:
        best_score = -100000000
        best_move = None
        for i in range(15):
            for j in range(15):
                if board[i][j] == "+":
                    board[i][j] = "X"
                    score = minimax(board, depth-1, alpha, beta, False)[1]
                    board[i][j] = "+"
                    if score > best_score:
                        best_score = score
                        best_move = (i, j)
                    alpha = max(alpha, best_score)
                    if beta <= alpha:
                        break
        return (best_move, best_score)

    # 如果是极小节点
    else:
        best_score = 100000000
        best_move = None
        for i in range(15):
            for j in range(15):
                if board[i][j] == "+":
                    board[i][j] = "O"
                    score = minimax(board, depth-1, alpha, beta, True)[1]
                    board[i][j] = "+"
                    if score < best_score:
                        best_score = score
                        best_move = (i, j)
                    beta = min(beta, best_score)
                    if beta <= alpha:
                        break
        return (best_move, best_score)

# 主函数
def main():
    board = init_board()
    print_board(board)

    while True:
        # 玩家下棋
        x = int(input("请输入行号（1-15）：")) - 1
        y = int(input("请输入列号（1-15）：")) - 1
        if board[x][y] != "+":
            print("该位置已经有棋子，请重新输入！")
            continue
        board[x][y] = "O"
        print_board(board)

        # 判断胜负
        if check_win(board) != None:
            print("你赢了！")
            break

        # AI下棋
        depth = 3
        print("电脑正在思考......")
        move, score = minimax(board, depth, -100000000, 100000000, True)
        print("电脑下棋的位置是：", move[0]+1, move[1]+1)
        board[move[0]][move[1]] = "X"
        print_board(board)

        # 判断胜负
        if check_win(board) != None:
            print("电脑赢了！")
            break

# 开始游戏
main()

该程序使用极大极小算法实现了一个简单的五子棋博弈系统。在主函数中，先让玩家下棋，然后再让电脑下棋。电脑下棋时，使用极大极小算法来找到最优的下棋位置。程序还实现了一个 `calculate_score` 函数，用于计算某个棋子在棋盘上的得分，以便在搜索过程中进行剪枝优化。