Tic-Tac-Toe （模拟）

最新推荐文章于 2024-03-13 06:37:50 发布
最新推荐文章于 2024-03-13 06:37:50 发布
阅读量999 收藏
点赞数
分类专栏： # 思维技巧
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/codeswarrior/article/details/79960098
版权

Tic-Tac-Toe

Two bears are playing tic-tac-toe via mail. It's boring for them to play usual tic-tac-toe game, so they are a playing modified version of this game. Here are its rules.

The game is played on the following field.

Players are making moves by turns. At first move a player can put his chip in any cell of any small field. For following moves, there are some restrictions: if during last move the opposite player put his chip to cell with coordinates (xl, yl) in some small field, the next move should be done in one of the cells of the small field with coordinates (xl, yl). For example, if in the first move a player puts his chip to lower left cell of central field, then the second player on his next move should put his chip into some cell of lower left field (pay attention to the first test case). If there are no free cells in the required field, the player can put his chip to any empty cell on any field.

You are given current state of the game and coordinates of cell in which the last move was done. You should find all cells in which the current player can put his chip.

A hare works as a postman in the forest, he likes to foul bears. Sometimes he changes the game field a bit, so the current state of the game could be unreachable. However, after his changes the cell where the last move was done is not empty. You don't need to find if the state is unreachable or not, just output possible next moves according to the rules.


Input

First 11 lines contains descriptions of table with 9 rows and 9 columns which are divided into 9 small fields by spaces and empty lines. Each small field is described by 9 characters without spaces and empty lines. character "x" (ASCII-code 120) means that the cell is occupied with chip of the first player, character "o" (ASCII-code 111) denotes a field occupied with chip of the second player, character "." (ASCII-code 46) describes empty cell.

The line after the table contains two integers x and y (1 ≤ x, y ≤ 9). They describe coordinates of the cell in table where the last move was done. Rows in the table are numbered from up to down and columns are numbered from left to right.

It's guaranteed that cell where the last move was done is filled with "x" or "o". Also, it's guaranteed that there is at least one empty cell. It's not guaranteed that current state of game is reachable.

Output

Output the field in same format with characters "!" (ASCII-code 33) on positions where the current player can put his chip. All other cells should not be modified.

Examples
Input 
... ... ...
... ... ...
... ... ...

... ... ...
... ... ...
... x.. ...

... ... ...
... ... ...
... ... ...
6 4
Output 
... ... ... 
... ... ... 
... ... ... 

... ... ... 
... ... ... 
... x.. ... 

!!! ... ... 
!!! ... ... 
!!! ... ...
Input 
xoo x.. x..
ooo ... ...
ooo ... ...

x.. x.. x..
... ... ...
... ... ...

x.. x.. x..
... ... ...
... ... ...
7 4
Output 
xoo x!! x!! 
ooo !!! !!! 
ooo !!! !!! 

x!! x!! x!! 
!!! !!! !!! 
!!! !!! !!! 

x!! x!! x!! 
!!! !!! !!! 
!!! !!! !!!
Input 
o.. ... ...
... ... ...
... ... ...

... xxx ...
... xox ...
... ooo ...

... ... ...
... ... ...
... ... ...
5 5
Output 
o!! !!! !!! 
!!! !!! !!! 
!!! !!! !!! 

!!! xxx !!! 
!!! xox !!! 
!!! ooo !!! 

!!! !!! !!! 
!!! !!! !!! 
!!! !!! !!!
Note

In the first test case the first player made a move to lower left cell of central field, so the second player can put a chip only to cells of lower left field.

In the second test case the last move was done to upper left cell of lower central field, however all cells in upper left field are occupied, so the second player can put his chip to any empty cell.

In the third test case the last move was done to central cell of central field, so current player can put his chip to any cell of central field, which is already occupied, so he can move anywhere. Pay attention that this state of the game is unreachable.

题目要求很简单，就是题目又臭又长，就是给你一个大的九宫格，每个九宫格又是一个小的九宫格，给定一个坐标，通过这个坐标在小的九宫格的位置，找到相应的大的九宫格的位置例如

... ... ...
... ... ...
... ... ...

... ... ...
... ... ...
... x.. ...

... ... ...
... ... ...
... ... ...
6 4
x是小的九宫格的位置，所以对应的大九宫格就是红色部分

让我们如果这个部分有点就变成！，然后输出全部，如果这部分全被ox占了，就把整个图中的.变成！然后输出全部。

取模找位置就行了

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
char G[12][12];
int x,y;
int main(){
    for(int i = 1; i <= 9; i++){
        for(int j = 1; j <= 9; j++){
            scanf("%c",&G[i][j]);
            if(j % 3 == 0) getchar();
        }
        if(i % 3 == 0 && i != 9) getchar();
    }
    scanf("%d%d",&x,&y);
    x = (x - 1) % 3 + 1;
    y = (y - 1) % 3 + 1;//得到大九宫格的位置
    int flag = 0;
    int sx = 3 * (x - 1) + 1;
    int sy = 3 * (y - 1) + 1;
    for(int i = sx; i < sx + 3; i++){
        for(int j = sy; j < sy + 3; j++){
            if(G[i][j] == '.'){
                G[i][j] = '!';
                flag = 1;
            }
        }
    }
    if(flag){
        for(int i = 1; i <= 9; i++){
            for(int j = 1; j <= 9; j++){
                printf("%c",G[i][j]);
                if(j % 3 == 0 && j != 9)
                    printf(" ");
            }
            printf("\n");
            if(i % 3 == 0 && i != 9)
                printf("\n");
        }
    }
    else{
        for(int i = 1; i <= 9; i++){
            for(int j = 1; j <= 9; j++){
                if(G[i][j] == '.') printf("!");
                else printf("%c",G[i][j]);
                if(j % 3 == 0 && j != 9)
                    printf(" ");
            }
            printf("\n");
            if(i % 3 == 0 && i != 9)
                printf("\n");
        }
    }
    return 0;
}

Guuuuuu老师儿
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
Tic-Tac-Toe游戏简介（AI井字棋游戏）
weixin_45936129的博客
05-05 2790
本章游戏项目将介绍如何使用AI(Artificial Intelligence，人工智能)来创建计算机对手。在该游戏中，玩家和计算机进行一场高赌注的人机Tic-Tac-Toe决战。计算机的棋艺令人生畏（尽管不是很完美），并且通过使其人格化来让比赛变得更有趣 文章目录一、游戏规划1.编写伪代码2.数据的表示3.创建函数列表二、程序源码 一、游戏规划 1.编写伪代码 伪代码的每一行就像是一个函数的调用。之后，所有要做的事情就是编写伪代码所暗示的函数 Create an empty Tic-Tac-Toe .
强化学习实践一：Tic-Tac-Toe游戏
热门推荐
xl.zhang的博客
01-14 1万+
这里给出一个简单的强化学习例子Tic-Tac-Toe。这是一个简单的游戏，在一个3x3的九宫格里，两个人轮流下，直到有个人的棋子满足三个一横一竖或者一斜，赢得比赛游戏结束，或者九宫格填满也没有人赢，则和棋。 这个例子的完整代码在我的github。例子只有一个文件，很简单，代码首先会用两个电脑选手训练模型，然后可以让人和机器对战。当然，由于这个模型很简单，所以只要你不乱走，最后的结果都是和棋，当然...
圈叉棋、套娃圈叉棋、嵌套圈叉棋、九个井字棋
nameofcsdn的博客
05-31 3731
棋
C语言编写小游戏：Tic Tac Toe（三子棋）
NiuPlus
04-19 5797
    三子棋：在3*3的棋盘中，谁先用自己的棋走出一条直线（横着三个/竖着三个/对角线三个），谁就算赢！下面我们就来一起编写一下这个小游戏吧！！！    首先我们先生成一个游戏菜单：void menu() { printf("*****三子棋*****\n"); printf("*****1:play*****\n"); printf("*****0:exit*****\n"); pri...
《C++游戏编程入门》第7章 指针：Tic-Tac-Toe 2.0
最新发布
yxqq378287007的博客
03-13 486
数组名是指向数组第一个元素的常量指针。const用来限制指针。包含内存地址的变量。
tic-tac-toe
03-16
cd ./tic-tac-toe sudo docker build -t tic-tac-toe . sudo docker run -p 8080:8080 tic-tac-toe ＃＃＃或者 没有码头工人。 在终端运行 git clone https://github.com/leoleoleonid/tic-tac-toe.git cd ./tic-...
Tic-Tac-Toe-Endgame:决策树
03-11
《Tic-Tac-Toe-Endgame:决策树在井字游戏终局分析中的应用》 在计算机科学和人工智能领域，决策树是一种广泛使用的算法，它通过构建一系列问题来解决问题或做出预测。在这个名为“Tic-Tac-Toe-Endgame”的项目中，...
tic-tac-toe-angular
06-03
#tic-tac-toe-angular5 月 17 日下午 5:45 部署您的 Firebase 应用程序输入您要用于托管 Firebase 应用的 Firebase 应用的名称：tictactoemaxwdi网站网址： : 输入应用程序公共目录的名称。 （通常是您存储 index....
java-tic-tac-toe
03-07
在实际的`java-tic-tac-toe-master`项目中，我们可能会看到以下文件结构： - `Game.java`: 游戏逻辑类，包含了游戏的启动和控制逻辑。 - `Board.java`: 棋盘类，表示游戏状态和操作。 - `Player.java`: 玩家类，...
tic-tac-toe游戏java程序下载
05-10
编写tic-tac-toe游戏程序。即 3*3的9个方格子，每人下一次看谁先连成一行3个。
Java程序开发-井字棋（控制台界面）
03-09
井字棋控制台界面开发，较为简单的一个小游戏，推荐java新手使用。
CodeForces - 907B Tic-Tac-Toe（模拟题）
Never__give__up的博客
04-02 357
B. Tic-Tac-Toe time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Two bears are playing tic-tac-toe via mail. It's borin
LeetCode 348. Design Tic-Tac-Toe（井字棋）
James Pan
05-18 4417
原题网址：https://leetcode.com/problems/design-tic-tac-toe/ Design a Tic-tac-toe game that is played between two players on a n x n grid. You may assume the following rules: A move is guaranteed
通过简单的强化学习实现井字棋（Tic-Tac-Toe）
JerryLife的博客
08-03 9516
一、强化学习简介 强化学习的过程可以理解为Agent与Environment的交互、学习、进步的过程，在井字棋中，可以简单的将其中的一方理解为Agent，另一方为Environment。交互的过程中主要有一下4个要素： 状态（state）：指可能出现的情况或局面，在井字棋中指局面上的落子情况与先后手。 操作（action）：指从一个状态（state）到另一个状态（state）的过程，在井字棋...
C. Tic-tac-toe
Luoriliming的博客
01-18 251
链接：https://codeforces.com/problemset/problem/3/C Certainly, everyone is familiar with tic-tac-toe game. The rules are very simple indeed. Two players take turns marking the cells in a3 × 3grid (one ...
[leetcode] 794. Valid Tic-Tac-Toe State @ python
闲庭信步
03-26 172
原题 A Tic-Tac-Toe board is given as a string array board. Return True if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game. The board is a 3 x 3 arra...
【模拟】Tic-tac-toe  C…
m42ping的专栏
02-02 392
Tic-tac-toe time limit per test 1 second memory limit per test 64 megabytes input standard input output standard output Certainly, everyone is familiar with tic-tac-toe game. The rules are ve
Tic-Tac-Toe
weixin_30471065的博客
05-18 178
Description Kim likes to play Tic-Tac-Toe. Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are cleve...
C. Tic-tac-toe【模拟】
希望的专栏
06-10 1508
C. Tic-tac-toe time limit per test 1 second memory limit per test 64 megabytes input standard input output standard output Certainly, everyone is familiar with tic-tac-t
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值