Linux网络编程10——使用UDP实现五子棋对战
思路
1. 通信
为了同步双方的棋盘，每当一方在棋盘上落子之后，都需要发送给对方一个msg消息，让对方知道落子位置。msg结构体如下:
/* 用于发给对方的信息 */
typedef struct tag_msg
{
int msg_type; /* 悔棋? */
int msg_color;
int msg_row;
int msg_col;
}MSG, *pMSG;
2. 悔棋
用链表头插法来模拟栈，链表记录了双方下子的轨迹。结构如下：
/* 记录每一步的轨迹 */
typedef struct tag_trace
{
int tr_cow;
int tr_col;
char tr_before[4]; /* 记录原来该位置的内容。注意要存下之前的！！ */
struct tag_trace* tr_next;
}TRACE, *pTRACE;
使用两个链表，一个链表用于记录自己下棋的轨迹，便于自己悔棋；另一个链表用于记录对方下棋的轨迹，便于对方悔棋。
3. 判断胜负
以水平方向为例：需要判断该棋子（包括该子）左边有多少相同颜色的棋子相连，以及右边有多少相同颜色的棋子相连，两者相加如果和大于等于5，则判赢。其余3个方向类似。具体可以参加代码。
4. 本代码用到了Linux网络编程9——对TCP与UDP的简易封装2.0中的动态库文件。
代码
chess.h
#ifndef __MY_CHESS_H__
#define __MY_CHESS_H__
#include "my_socket.h"
#include <pthread.h> #define MSG_NORMAL 1
#define MSG_BACK 2
#define CH_BLACK 1
#define CH_WHITE 2
#define ROW 19
#define COL 19
#define WHITE_CHESS "○"
#define BLACK_CHESS "●" typedef struct tag_msg
{
int msg_type ;
int msg_color ;
int msg_row ;
int msg_col ;
}MSG, *pMSG ; typedef struct tag_trace
{
int tr_row ;
int tr_col ;
char tr_before[4] ;
struct tag_trace* tr_next ;
}TRACE, *pTRACE; void chess_show(char ch[][COL][4], int row);
int chess_win(char arr[][COL][4], int row, int pos_x, int pos_y, char* color); #endif
chess.c
/*************************************************************************
> File Name: chess.c
> Author: KrisChou
> Mail:zhoujx0219@163.com
> Created Time: Wed 03 Sep 2014 09:35:57 PM CST
************************************************************************/
#include "chess.h" void chess_show(char arr[][COL][4], int row_cnt)
{
int row, col ;
printf(" ");
for(col = 0; col < COL ; col ++)
{
printf("%2d", col + 1);
}
printf("\n");
for(row = 0; row < row_cnt ; row ++)
{
printf("%3d ", row + 1);
for(col = 0; col < COL ; col ++)
{
printf("%s", arr[row][col]);
if(col != row_cnt -1 )
{
printf("-");
}
}
printf("\n");
}
printf("\n"); }
int chess_win(char arr[][COL][4], int row, int pos_x, int pos_y, char* color)
{
// level
int cnt1, cnt2 ;
int index_x, index_y ;
for(cnt1 = 0,index_x = pos_x, index_y = pos_y; index_y < COL; index_y ++)
{
if(strcmp(arr[index_x][index_y], color) == 0)
{
cnt1 ++ ;
}else
{
break ;
}
}
for(cnt2 = 0, index_x = pos_x , index_y = pos_y - 1 ; index_y >= 0; index_y --)
{
if(strcmp(arr[index_x][index_y], color) == 0)
{
cnt2 ++ ;
}else
{
break ;
}
}
if(cnt1 + cnt2 >= 5)
{
return 1 ;
}
// vertical
for(cnt1 = 0,index_x = pos_x, index_y = pos_y; index_x >= 0; index_x --)
{
if(strcmp(arr[index_x][index_y], color) == 0)
{
cnt1 ++ ;
}else
{
break ;
}
}
for(cnt2 = 0, index_x = pos_x + 1 , index_y = pos_y ; index_x < row ; index_x ++)
{
if(strcmp(arr[index_x][index_y], color) == 0)
{
cnt2 ++ ;
}else
{
break ;
}
}
if(cnt1 + cnt2 >= 5)
{
return 1 ;
}
// + ==
int sum = pos_x + pos_y ;
for(cnt1 = 0, index_x = pos_x; index_x >= 0 && sum - index_x < COL; index_x --)
{
if(strcmp(arr[index_x][sum - index_x], color) == 0)
{
cnt1 ++ ;
}else
{
break ;
}
}
for(cnt2 = 0, index_x = pos_x + 1; index_x < row && index_x <= sum ; index_x ++ )
{
if(strcmp(arr[index_x][sum - index_x], color) == 0)
{
cnt2 ++ ;
}else
{
break ;
}
}
if(cnt1 + cnt2 >= 5)
{
return 1 ;
}
// abs - ==
int delt ;
if(pos_x > pos_y)
{
delt = pos_x - pos_y ;
for(cnt1 = 0 , index_x = pos_x; index_x >=0 && index_x >= delt; index_x --)
{
if(strcmp(arr[index_x][index_x - delt], color) == 0)
{
cnt1 ++ ;
}else
{
break ;
}
}
for(cnt2 = 0, index_x = pos_x + 1; index_x < row ; index_x ++)
{
if(strcmp(arr[index_x][index_x - delt], color) == 0)
{
cnt2 ++ ;
}else
{
break ;
}
}
}else// pos_y >= pos_x
{
delt = pos_y - pos_x ;
for(cnt1 = 0 , index_x = pos_x; index_x >=0 ; index_x --)
{
if(strcmp(arr[index_x][index_x + delt], color) == 0)
{
cnt1 ++ ;
}else
{
break ;
}
}
for(cnt2 = 0, index_x = pos_x + 1; index_x < row && index_x + delt < COL ; index_x ++)
{
if(strcmp(arr[index_x][index_x + delt], color) == 0)
{
cnt2 ++ ;
}else
{
break ;
}
}
}
if(cnt1 + cnt2 >= 5)
{
return 1 ;
}
return 0;
}
main.c
/*************************************************************************
> File Name: main.c
> Author: KrisChou
> Mail:zhoujx0219@163.com
> Created Time: Wed 03 Sep 2014 10:04:07 PM CST
************************************************************************/
#include "chess.h"
#define B_IP "127.0.0.1"
#define B_PORT 8888
#define W_IP "127.0.0.1"
#define W_PORT 6666
#define POS_TRANS(pos) (pos -1)
#define IS_OK(row, col) ( row >= 0 && col >= 0 && col <= 18 &&row <= 18 &&strcmp(my_chess[row][col], WHITE_CHESS) != 0 && strcmp(my_chess[row][col], BLACK_CHESS) != 0)
int main(int argc, char* argv[])
{
char my_chess[ROW][COL][4] =
{
"┌","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┬","┐" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"├","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┼","┤" ,
"└","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┴","┘" };
int sfd ;
pTRACE my_tr, peer_tr, pStep, pTmp ; my_tr = NULL ;
peer_tr = NULL ;
#ifdef FIRST
my_socket(&sfd, MY_UDP, B_IP, B_PORT);
#else
my_socket(&sfd, MY_UDP, W_IP, W_PORT);
#endif
int row, col ;
MSG my_msg ;
#ifdef FIRST
chess_show(my_chess, ROW);
while(1)// 0, 0
{
do
{
printf(">>");
scanf("%d%d", &row, &col);
if(row == 0 || col == 0)
{
break ;
}
}while( !IS_OK(POS_TRANS(row), POS_TRANS(col))) ;
if(row !=0 && col != 0)// normal
{
my_msg.msg_type = MSG_NORMAL ;
my_msg.msg_color = CH_BLACK ;
my_msg.msg_row = POS_TRANS(row) ;
my_msg.msg_col = POS_TRANS(col) ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), W_IP, W_PORT); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = POS_TRANS(row) ;
pStep ->tr_col = POS_TRANS(col) ;
strcpy(pStep ->tr_before, my_chess[POS_TRANS(row)][POS_TRANS(col)]) ; pStep -> tr_next = my_tr ;
my_tr = pStep ; strcpy(my_chess[POS_TRANS(row)][POS_TRANS(col)], BLACK_CHESS); system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, POS_TRANS(row), POS_TRANS(col), BLACK_CHESS))
{
printf("black win !");
exit(1);
}
}else
{
if(my_tr == NULL)
{
continue ;
}else
{
memset(&my_msg, 0, sizeof(MSG));
my_msg.msg_type = MSG_BACK ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), W_IP, W_PORT);
strcpy(my_chess[my_tr -> tr_row][my_tr -> tr_col], my_tr ->tr_before);
system("clear");
chess_show(my_chess, ROW); pTmp = my_tr ;
my_tr = my_tr -> tr_next ;
free(pTmp);
pTmp = NULL ; /* 本方悔棋后，需要在下一次 */
do{
printf(">>");
scanf("%d%d", &row, &col);
}while( !IS_OK(POS_TRANS(row), POS_TRANS(col))) ; my_msg.msg_type = MSG_NORMAL ;
my_msg.msg_color = CH_BLACK ;
my_msg.msg_row = POS_TRANS(row) ;
my_msg.msg_col = POS_TRANS(col) ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), W_IP, W_PORT); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = POS_TRANS(row) ;
pStep ->tr_col = POS_TRANS(col) ;
strcpy(pStep ->tr_before, my_chess[POS_TRANS(row)][POS_TRANS(col)]) ; pStep -> tr_next = my_tr ;
my_tr = pStep ; strcpy(my_chess[POS_TRANS(row)][POS_TRANS(col)], BLACK_CHESS); system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, POS_TRANS(row), POS_TRANS(col), BLACK_CHESS))
{
printf("black win !");
exit(1);
} }
} memset(&my_msg, 0, sizeof(MSG));
my_recvfrom(NULL, sfd, &my_msg, sizeof(MSG), NULL, NULL);
if(my_msg.msg_type == MSG_NORMAL)
{
pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = my_msg.msg_row ;
pStep ->tr_col = my_msg.msg_col ;
strcpy(pStep ->tr_before, my_chess[my_msg.msg_row][my_msg.msg_col]) ;
pStep -> tr_next = peer_tr;
peer_tr = pStep ; strcpy(my_chess[my_msg.msg_row][my_msg.msg_col], WHITE_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, my_msg.msg_row, my_msg.msg_col, WHITE_CHESS))
{
printf("white win !");
exit(1);
}
}else if(my_msg.msg_type == MSG_BACK)
{
strcpy(my_chess[peer_tr -> tr_row][peer_tr -> tr_col], peer_tr ->tr_before);
system("clear");
chess_show(my_chess, ROW); pTmp = peer_tr ;
peer_tr = peer_tr -> tr_next ;
free(pTmp);
pTmp = NULL ; /* 对方悔棋后，本方需要再收一次 */
memset(&my_msg, 0, sizeof(MSG));
my_recvfrom(NULL, sfd, &my_msg, sizeof(MSG), NULL, NULL); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = my_msg.msg_row ;
pStep ->tr_col = my_msg.msg_col ;
strcpy(pStep ->tr_before, my_chess[my_msg.msg_row][my_msg.msg_col]) ;
pStep -> tr_next = peer_tr;
peer_tr = pStep ; strcpy(my_chess[my_msg.msg_row][my_msg.msg_col], WHITE_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, my_msg.msg_row, my_msg.msg_col, WHITE_CHESS))
{
printf("white win !");
exit(1);
}
}
}
#else
{
chess_show(my_chess, ROW);
while(1)
{
memset(&my_msg, 0, sizeof(MSG));
my_recvfrom(NULL, sfd, &my_msg, sizeof(MSG), NULL, NULL);
if(my_msg.msg_type == MSG_NORMAL)
{ pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = my_msg.msg_row ;
pStep ->tr_col = my_msg.msg_col ;
strcpy(pStep ->tr_before, my_chess[my_msg.msg_row][my_msg.msg_col]) ;
pStep -> tr_next = peer_tr;
peer_tr = pStep ; strcpy(my_chess[my_msg.msg_row][my_msg.msg_col], BLACK_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, my_msg.msg_row, my_msg.msg_col, BLACK_CHESS))
{
printf("black win !");
exit(1);
} }else if(my_msg.msg_type == MSG_BACK)
{
strcpy(my_chess[peer_tr -> tr_row][peer_tr -> tr_col], peer_tr ->tr_before);
system("clear");
chess_show(my_chess, ROW); pTmp = peer_tr ;
peer_tr = peer_tr -> tr_next ;
free(pTmp);
pTmp = NULL ; memset(&my_msg, 0, sizeof(MSG));
my_recvfrom(NULL, sfd, &my_msg, sizeof(MSG), NULL, NULL); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = my_msg.msg_row ;
pStep ->tr_col = my_msg.msg_col ;
strcpy(pStep ->tr_before, my_chess[my_msg.msg_row][my_msg.msg_col]) ;
pStep -> tr_next = peer_tr;
peer_tr = pStep ; strcpy(my_chess[my_msg.msg_row][my_msg.msg_col], BLACK_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, my_msg.msg_row, my_msg.msg_col, BLACK_CHESS))
{
printf("black win !");
exit(1);
} } do{
printf(">>");
scanf("%d%d", &row, &col);
if(row == 0 || col == 0)
{
break ;
}
}while(!IS_OK(POS_TRANS(row), POS_TRANS(col))) ;
if(row != 0 && col != 0 )//normal
{
my_msg.msg_type = MSG_NORMAL ;
my_msg.msg_color = CH_WHITE ;
my_msg.msg_row = POS_TRANS(row) ;
my_msg.msg_col = POS_TRANS(col) ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), B_IP, B_PORT); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = POS_TRANS(row) ;
pStep ->tr_col = POS_TRANS(col) ;
strcpy(pStep ->tr_before, my_chess[POS_TRANS(row)][POS_TRANS(col)]) ; pStep -> tr_next = my_tr ;
my_tr = pStep ; strcpy(my_chess[POS_TRANS(row)][POS_TRANS(col)], WHITE_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, POS_TRANS(row), POS_TRANS(col), WHITE_CHESS))
{
printf("white win !");
exit(1);
} }else
{
if(my_tr == NULL)
{
continue ;
}else
{
memset(&my_msg, 0, sizeof(MSG));
my_msg.msg_type = MSG_BACK ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), B_IP, B_PORT);
strcpy(my_chess[my_tr -> tr_row][my_tr -> tr_col], my_tr ->tr_before);
system("clear");
chess_show(my_chess, ROW); pTmp = my_tr ;
my_tr = my_tr -> tr_next ;
free(pTmp);
pTmp = NULL ; do{
printf(">>");
scanf("%d%d", &row, &col);
}while(!IS_OK(POS_TRANS(row), POS_TRANS(col)) ); my_msg.msg_type = MSG_NORMAL ;
my_msg.msg_color = CH_WHITE ;
my_msg.msg_row = POS_TRANS(row) ;
my_msg.msg_col = POS_TRANS(col) ;
my_sendto(NULL, sfd, &my_msg, sizeof(MSG), B_IP, B_PORT); pStep = (pTRACE)calloc(1, sizeof(TRACE)) ;
pStep ->tr_row = POS_TRANS(row) ;
pStep ->tr_col = POS_TRANS(col) ;
strcpy(pStep ->tr_before, my_chess[POS_TRANS(row)][POS_TRANS(col)]) ; pStep -> tr_next = my_tr ;
my_tr = pStep ; strcpy(my_chess[POS_TRANS(row)][POS_TRANS(col)], WHITE_CHESS);
system("clear");
chess_show(my_chess, ROW);
if(chess_win(my_chess, ROW, POS_TRANS(row), POS_TRANS(col), WHITE_CHESS))
{
printf("white win !");
exit(1);
} } }
} }
#endif
return 0 ;
}
编译如下：
gcc -o black *.c -DFIRST -lmy_socket -I/home/purple/include
gcc -o white *.c -lmy_socket -I/home/purple/include
Linux网络编程10——使用UDP实现五子棋对战的更多相关文章
- Linux网络编程四、UDP，广播和组播
一.UDP UDP:是一个支持无连接的传输协议,全称是用户数据包协议(User Datagram Protocol).UDP协议无需像TCP一样要建立连接后才能发送封装的IP数据报,也是因此UDP相较 ...
- Linux 网络编程五（UDP协议）
UDP和TCP的对比 --UDP处理的细节比TCP少. --UDP不能保证消息被传送到目的地. --UDP不能保证数据包的传递顺序. --TCP处理UDP不处理的细节. --TCP是面向连接的协议 - ...
- Linux网络编程：基于UDP的程序开发回顾篇
基于无连接的UDP程序设计 同样,在开发基于UDP的应用程序时,其主要流程如下: 对于面向无连接的UDP应用程序在开发过程中服务端和客户端的操作流程基本差不多.对比面向连接的TCP程序,服务端少了 ...
- Linux网络编程5——使用UDP协议实现群聊
引言 本文实现的功能类似于我之前所写的一篇博文(Linux之select系统调用_2),区别在于进程之间的通信方式有所不同.之前的文章中,我所使用的是管道,而本文我将会使用socket接口. 需求 客 ...
- Linux网络编程入门 (转载)
(一)Linux网络编程--网络知识介绍 Linux网络编程--网络知识介绍客户端和服务端 网络程序和普通的程序有一个最大的区别是网络程序是由两个部分组成的--客户端和服务器端. 客户 ...
- [转] - Linux网络编程 -- 网络知识介绍
(一)Linux网络编程--网络知识介绍 Linux网络编程--网络知识介绍客户端和服务端 网络程序和普通的程序有一个最大的区别是网络程序是由两个部分组成的--客户端和服务器端. 客户 ...
- 【转】Linux网络编程入门
(一)Linux网络编程--网络知识介绍 Linux网络编程--网络知识介绍客户端和服务端 网络程序和普通的程序有一个最大的区别是网络程序是由两个部分组成的--客户端和服务器端. 客户 ...
- 《转》Linux网络编程入门
原地址:http://www.cnblogs.com/duzouzhe/archive/2009/06/19/1506699.html (一)Linux网络编程--网络知识介绍 Linux网络编程-- ...
- Linux网络编程学习路线
转载自:https://blog.csdn.net/lianghe_work/article 一.网络应用层编程 1.Linux网络编程01——网络协议入门 2.Linux网络编程02——无连接和 ...
随机推荐
- hdu 4941 Magical Forest
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=4941 Magical Forest Description There is a forest can ...
- hdu 1548 A strange lift
题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=1548 A strange lift Description There is a strange li ...
- RCF
1. RCF: 纯c++的RPC, 不引入IDL, 大量用到boost,比较强大.2. casocklib: protobuf + asio 较完善实现3. eventrpc: protobuf + ...
- python中的各种排序
#encoding=utf-8 import random from copy import copy def directInsertSort(seq): """ 直接 ...
- Tornado服务器的学习
Tornado就是我们在 FriendFeed 的 Web 服务器及其常用工具的开源版本.Tornado 和现在的主流 Web 服务器框架(包括大多数 Python 的框架)有着明显的区别:它是非阻塞 ...
- 57.DDR3的系统时钟编译错误
错误:Xst:2033 - Port I of Input buffer ddr3_mig/memc3_infrastructure_inst/se_input_clk.u_ibufg_sys_clk ...
- 如何在Quartus II中设置Virtual pin
为了验证FPGA工程中的某个模块的功能和时序的正确性,常常需要对其单独进行验证,但是这些模块通常都与内部的众多信号相连(如系统总线,中断信号线等),往往一个模块的对外接口引脚会多达几百个,对其单独仿真 ...
- java中字符串String 转 int(转)
java中字符串String 转 int String -> int s="12345"; int i; 第一种方法:i=Integer.parseInt(s); 第二种方法 ...
- VS2013 help viewer搜索结果显示源码以及桌面独立运行help viewer
安装好VS2013后,启动help viewer2.1在搜索栏中搜搜时结果会出现HTML源码. 要解决这个问题先来看看MINE,即Multipurpose Internet Mail Extensio ...
- 使用高德地图SDK获取定位信息
使用高德地图SDK获取定位信息 第一步: 在高德官网下载SDK,如我这里需要获取定位信息,故仅下载"定位功能" 第二步: 注册成为开发者,并创建应用获取相应的key.其中,在使用A ...