比较改动
选两个分支看看改了什么，再发起 PR 把工作带过去。
可以合并。 这两个分支可以自动合并。
登录后才能发起 PR。
2 个提交
Weigh every point by the open and closed lines it makes and breaks
turing-claude 2周前提交
dd0cb54 turing-claude 2周前提交+11 −0 routes/threat-weights/README.md 新增 查看文件
| @@ -0,0 +1,11 @@ | ||
| 1 | +--- | |
| 2 | +issue: 1 | |
| 3 | +status: working | |
| 4 | +--- | |
| 5 | +# threat-weights | |
| 6 | + | |
| 7 | +Weigh every point by the open and closed lines it makes and breaks. | |
| 8 | + | |
| 9 | +## Next | |
| 10 | + | |
| 11 | +Watch the matches it loses and fix the first mistake. | |
+66 −0 routes/threat-weights/bot.py 新增 查看文件
| @@ -0,0 +1,66 @@ | ||
| 1 | +"""A Gomocup brain that weighs every empty point near the stones by the lines it would make for itself and the lines it | |
| 2 | +would break for the other side (open and closed twos, threes and fours), and plays the heaviest.""" | |
| 3 | +import sys | |
| 4 | + | |
| 5 | +N, board, me = 15, {}, 1 | |
| 6 | +D = [(1, 0), (0, 1), (1, 1), (1, -1)] | |
| 7 | +WEIGHT = {(5, 0): 1e7, (5, 1): 1e7, (5, 2): 1e7, (4, 2): 1e5, (4, 1): 1e4, (3, 2): 5e3, (3, 1): 400, (2, 2): 300, (2, 1): 40, (1, 2): 10, (1, 1): 2} | |
| 8 | + | |
| 9 | + | |
| 10 | +def line(x, y, c, dx, dy): | |
| 11 | + n, ends = 1, 0 | |
| 12 | + for s in (1, -1): | |
| 13 | + i = 1 | |
| 14 | + while board.get((x + s * i * dx, y + s * i * dy)) == c: | |
| 15 | + n += 1 | |
| 16 | + i += 1 | |
| 17 | + a, b = x + s * i * dx, y + s * i * dy | |
| 18 | + if 0 <= a < N and 0 <= b < N and (a, b) not in board: | |
| 19 | + ends += 1 | |
| 20 | + return min(n, 5), ends | |
| 21 | + | |
| 22 | + | |
| 23 | +def value(x, y): | |
| 24 | + attack = sum(WEIGHT.get(line(x, y, me, dx, dy), 0) for dx, dy in D) | |
| 25 | + defend = sum(WEIGHT.get(line(x, y, 3 - me, dx, dy), 0) for dx, dy in D) | |
| 26 | + return attack * 1.1 + defend | |
| 27 | + | |
| 28 | + | |
| 29 | +def move(): | |
| 30 | + near = {(x + a, y + b) for (x, y) in board for a in (-2, -1, 0, 1, 2) for b in (-2, -1, 0, 1, 2)} | |
| 31 | + cands = [p for p in near if 0 <= p[0] < N and 0 <= p[1] < N and p not in board] or [(N // 2, N // 2)] | |
| 32 | + return max(cands, key=lambda p: (value(*p), -abs(p[0] - N // 2) - abs(p[1] - N // 2))) | |
| 33 | + | |
| 34 | + | |
| 35 | +def play(): | |
| 36 | + x, y = move() | |
| 37 | + board[(x, y)] = me | |
| 38 | + print(f'{x},{y}', flush=True) | |
| 39 | + | |
| 40 | + | |
| 41 | +for raw in sys.stdin: | |
| 42 | + cmd, _, arg = raw.strip().partition(' ') | |
| 43 | + cmd = cmd.upper() | |
| 44 | + if cmd == 'START': | |
| 45 | + N = int(arg) | |
| 46 | + board.clear() | |
| 47 | + print('OK', flush=True) | |
| 48 | + elif cmd == 'BEGIN': | |
| 49 | + play() | |
| 50 | + elif cmd == 'TURN': | |
| 51 | + x, y = map(int, arg.split(',')) | |
| 52 | + board[(x, y)] = 2 | |
| 53 | + play() | |
| 54 | + elif cmd == 'BOARD': | |
| 55 | + for l in sys.stdin: | |
| 56 | + if l.strip().upper() == 'DONE': | |
| 57 | + break | |
| 58 | + x, y, f = map(int, l.split(',')) | |
| 59 | + board[(x, y)] = 1 if f == 1 else 2 | |
| 60 | + play() | |
| 61 | + elif cmd == 'ABOUT': | |
| 62 | + print('name="threats", version="1", author="shoal-games"', flush=True) | |
| 63 | + elif cmd == 'END': | |
| 64 | + break | |
| 65 | + elif cmd not in ('INFO', 'RESTART'): | |
| 66 | + print('UNKNOWN', flush=True) | |