HDOJ 4155 The Game of 31 博弈搜索
2012-09-22 00:32
399 查看
//HDOJ 4155 The Game of 31 博弈搜索 /* 题意:有编号为1、2、3、4、5、6的牌各4张,共24张,两个人轮流取牌, 取牌后要使所有取出的牌的总不超过31,不能取的输。 游戏从给定的局面开始。 思路:从给定的局面开始dfs,当此状态能够到达p状态,则此状态有n状态 否则为p状态,然后判断此时是先手还是后手 */ #include<stdio.h> #include<string.h> #include<stdlib.h> #define N 100 #define M 10 char str ; int num[M]; int len,sum; void init(){ int i; for(i = 1; i <= 6; ++i) num[i] = 4; len = strlen(str); sum = 0; for(i = 0; i < len; ++i){ --num[str[i]-'0']; sum += str[i]-'0'; } } bool dfs(int sum){ int i; if(sum > 31) return 0; for(i = 1; i <= 6; ++i){ if(num[i] && sum+i<=31){ --num[i]; if(dfs(sum+i) == 0){ ++num[i]; return 1; } ++num[i]; } } return 0; } int main(){ while(scanf("%s",&str)!=EOF){ init(); printf("%s ",str); if(dfs(sum)) puts(len%2 ? "B" : "A"); else puts(len%2 ? "A" : "B"); } return 0; }
相关文章推荐
- HDU 4155 The Game of 31 (博弈)
- hdu 4155 The Game of 31 博弈论
- HDU 4155 The Game of 31
- The Game of 31 (博弈)
- poj 4155 The Game of 31
- hdu 4155 The Game of 31
- 【记忆化搜索】 HDU-4155-The Game of 31
- Looksery Cup 2015 C. The Game Of Parity —— 博弈
- ZOJ1827_The Game of 31
- Codeforces 549C. The Game Of Parity 博弈
- HDOJ 1010 Tempter of the Bone(搜索,奇偶剪枝)
- HDOJ-1667/TJU4106 The Rotation Game(IDA*搜索)
- ZOJ 1827 The Game of 31
- AlphaGo论文的译文,用深度神经网络和树搜索征服围棋:Mastering the game of Go with deep neural networks and tree search
- hdu4155 The Game of 31
- AlphaGo论文的译文,用深度神经网络和树搜索征服围棋:Mastering the game of Go with deep neural networks and tree search
- ECPC16-A.The game of Osho(博弈)
- ZOJ1827 HDU4155 The Game of 31,博弈论+爆搜
- codeforces 549C C. The Game Of Parity(博弈)
- zoj 1827 The Game of 31