Stake Your Claim

// ConsoleApplication1.cpp: 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <cstring>
#include <cstdio>
#define INF 1000000

using namespace std;

int Map[8][8], vis[8][8], N, xx[4] = { 0, 0, 1, -1 }, yy[4] = {1, -1, 0, 0}, score0, score1, X, Y;

void DFS(int num, int m, int n, int *s) {
for (int i = 0; i < 4; ++i) {
  int x, y;
  x = m + xx[i];
  y = n + yy[i];
  if (x >= 0 && x < N && y >= 0 && y < N && !vis[x][y] && Map[x][y] == num) {
   *s = *s + 1;
   vis[x][y] = 1;
   DFS(num, x, y, s);
  }
}
}

int alpha_beta(int cnt, int player, int alpha, int beta, int now_cnt, int now_player) {
int i, j, val;
if (cnt == N * N) {
  score0 = score1 = 0;
  memset(vis, 0, sizeof(vis));
  for (int i = 0; i < N; ++i)
   for (int j = 0; j < N; ++j) {
    if (Map[i][j] == 1 && !vis[i][j]) {
     vis[i][j] = 1;
     int score = 1;
     DFS(1, i, j, &score);
     if (score > score0)
      score0 = score;
    }
    if (Map[i][j] == 2 && !vis[i][j]) {
     vis[i][j] = 1;
     int score = 1;
     DFS(2, i, j, &score);
     if (score > score1)
      score1 = score;
    }
   }
  return score0 - score1;
}

if (player == 0) {
  for (i = 0; i < N; ++i)
   for (int j = 0; j < N; ++j) {
    if (Map[i][j])
     continue;
    Map[i][j] = 1;
    val = alpha_beta(cnt + 1, 1 - player, alpha, beta, now_cnt, now_player);
    Map[i][j] = 0;
    if (val > alpha) {
     alpha = val;
     if (now_player == 0 && cnt == now_cnt) {
      X = i;
      Y = j;
     }
    }
    if (alpha >= beta)
     return alpha;
   }
  return alpha;
}
else {
  for (i = 0; i < N; ++i)
   for (int j = 0; j < N; ++j) {
    if (Map[i][j])
     continue;
    Map[i][j] = 2;
    val = alpha_beta(cnt + 1, 1 - player, alpha, beta, now_cnt, now_player);
    Map[i][j] = 0;
    if (val < beta) {
     beta = val;
     if (now_player == 1 && cnt == now_cnt) {
      X = i;
      Y = j;
     }
    }
    if (alpha >= beta)
     return beta;
   }
  return beta;
}
}

int main()
{
int S0, S1, cnt;
char ch;
while (cin >> N) {
  if (N == 0)
   break;
  S0 = S1 = cnt = 0;
  memset(Map, 0, sizeof(Map));
  for (int i = 0; i < N; ++i) {
   for (int j = 0; j < N; ++j) {
    cin >> ch;
    if (ch == '0') {
     cnt++;
     S0++;
     Map[i][j] = 1;
    }
    else if (ch == '1') {
     cnt++;
     S1++;
     Map[i][j] = 2;
    }
    else
        Map[i][j] = 0;
   }
  }

if (S0 == S1) {
   int score0 = alpha_beta(cnt, 0, -INF, INF, cnt, 0);
   printf("(%d,%d) %d\n", X, Y, score0);
  }
  else {
   int score1 = alpha_beta(cnt, 1, -INF, INF, cnt, 1);
   printf("(%d,%d) %d\n", X, Y, -score1);
  }
}
    return 0;
}

Stake Your Claim相关推荐

ACM题集以及各种总结大全（转）
ACM题集以及各种总结大全! 虽然退役了,但是整理一下,供小弟小妹们以后切题方便一些,但由于近来考试太多,顾退役总结延迟一段时间再写!先写一下各种分类和题集,欢迎各位大牛路过指正. 一.ACM入门关 ...
前前前世用计算机,前前前世
At last "Hello!" You've opened your eyes But why won't you even look me in the eyes? What' ...
csdn无人驾驶汽车_无人驾驶汽车100年历史
csdn无人驾驶汽车 The first self-driving vehicles were ships. After centuries of wrestling with wind and wa ...
计算机英语名词简释（转）
计算机英语名词简释一.著名公司及其商标名 Microsoft: 有时缩略为MS,是全球最著名的软件商,美国软件巨头微软公司的名字.Microsoft其实是由两个英语单词组成:Micro意为" ...
计算机英语名词简释(轉載)
计算机英语名词简释一.著名公司及其商标名 Microsoft: 有时缩略为MS,是全球最著名的软件商,美国软件巨头微软公司的名字.Microsoft其实是由两个英语单词组成:Micro意为" ...
计算机英语名词简释（转载）
计算机英语名词简释一.著名公司及其商标名 Microsoft: 有时缩略为MS,是全球最著名的软件商,美国软件巨头微软公司的名字.Microsoft其实是由两个英语单词组成:Micro意为" ...
极大极小算法和AlphaBeta剪枝算法
作为菜鸟,先贴上参考博文: 1.极小极大算法 2.<<CS 161 Recitation Notes - The Minimax Algorithm>> 3.<PC游戏编 ...
使用 go 实现 Proof of Stake 共识机制
使用 go 实现 Proof of Stake 共识机制什么是 Proof of Stake 在PoW中,节点之间通过hash的计算力来竞赛以获取下一个区块的记账权,而在PoS中,块是已经铸造好的, ...
【译】The missing explanation of Proof of Stake Version 3
在每一个加密货币中,都必须有一些共识机制来保持整个分布式网络的同步. 当比特币首次推出时,它推出了工作证明(PoW)系统. PoW是通过反复加密散列一块数据(块头)来完成的. 由于单向哈希如何工作. ...

Stake Your Claim

Stake Your Claim相关推荐

最新文章

热门文章