ReversiGo/self_matchv2.py at master · PPPSDavid/ReversiGo · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
'''
An implementation of the alpha-beta search tree with a simple evaluation method(sum of space) and multi threading
'''
import GameCore as GM
import time
import multiprocessing as mp

output = mp.Queue()

def self_match2(times,output):
    values=[]
    time_1_total = 0
    time_2_total = 0
    time_1_max = 0
    time_2_max = 0

    for i in range(times):
        board = GM.setBoard(8)
        test_1 = GM.getValidMove(board, 1)
        test_2 = GM.getValidMove(board, -1)

        while (len(test_1) != 0 or len(test_2) != 0):
            if len(test_1) != 0:
                time_1 = time.time()
                board = GM.makeMove(board, 1, GM.alpha_beta_with_human(board, 1, 3))
                new_time = time.time()-time_1

                time_1_total = time_1_total+(new_time)
                if new_time>time_1_max:
                    time_1_max = new_time
                test_1 = GM.getValidMove(board, 1)
                test_2 = GM.getValidMove(board, -1)
                #print('the following step is {}'.format(1))
                #GM.printBoard(board)

            if len(test_2) != 0:
                time_2 = time.time()
                board = GM.makeMove(board, -1, GM.alpha_beta1(board, -1, 3))
                new_time = time.time()-time_2

                time_2_total = time_2_total+(new_time)
                if new_time>time_2_max:
                    time_2_max = new_time
                test_1 = GM.getValidMove(board, 1)
                test_2 = GM.getValidMove(board, -1)
                #print('the following step is {}'.format(-1))
                #GM.printBoard(board)

        value = [GM.getBoardValue(board, 1), GM.getBoardValue(board, -1)]
        if value[0]>value[1]:
            value.append(1)
        else:
            value.append(-1)
        values.append(value)
    count = 0
    for k in values:
        if k[2]==1:
            count+=1
    result_string = '------1 wins {}, -1 wins {}||||1 takes {} time, -1 takes {} times|||||The maximum time for 1 is {}, and for -1 is {}.------'.format(count,times-count,time_1_total/times/32,time_2_total/times/32,time_1_max,time_2_max)

    output.put(result_string)
    #print('1 wins {}, -1 wins {}'.format(count,times-count))
    #print('1 takes {} time, -1 takes {} times'.format(time_1_total/times/32,time_2_total/times/32))
    #print('The maximum time for 1 is {}, and for -1 is {}.'.format(time_1_max,time_2_max))


if __name__=='__main__':
    processes = [mp.Process(target=self_match2, args=(10,output)) for x in range(4)]
    for p in processes:
        p.start()
    for p in processes:
        p.join()
    results = [output.get() for p in processes]
    print(results)