#include <stdio.h>
#include <stdlib.h>

#define N 15

int chessboard[N + 1][N + 1] = { 0 };

int whoseTurn = 0;

void initGame(void);
void printChessboard(void);
void playChess(void);
int judge(int, int);

int main(void)
{
 initGame();

 while (1)
 {
  whoseTurn++;

  playChess();
 }

 return 0;
}

void initGame(void)
{
 char c;

 printf("Please input \'y\' to enter the game:");
 c = getchar();
 if ('y' != c && 'Y' != c)
  exit(0);

 system("cls");
 printChessboard();
}

void printChessboard(void)
{
 int i, j;

 for (i = 0; i <= N; i++)
 {
  for (j = 0; j <= N; j++)
  {
   if (0 == i)
    printf("%3d", j);
   else if (j == 0)
    printf("%3d", i);
   else if (1 == chessboard[i][j])
    printf(" O");
   else if (2 == chessboard[i][j])
    printf(" X");
   else
    printf(" *");
  }
  printf("\n");
 }
}

void playChess(void)
{
 int i, j, winner;

 if (1 == whoseTurn % 2)
 {
  printf("Turn to player 1, please input the position:");
  scanf("%d %d", &i, &j);

  while (chessboard[i][j] != 0)
  {
   printf("This position has been occupied, please input the position again:");
   scanf("%d %d", &i, &j);
  }

  chessboard[i][j] = 1;
 }
 else
 {
  printf("Turn to player 1, please input the position:");
  scanf("%d %d", &i, &j);

  while (chessboard[i][j] != 0)
  {
   printf("This position has been occupied, please input the position again:");
   scanf("%d %d", &i, &j);
  }

  chessboard[i][j] = 2;
 }

 system("cls");
 printChessboard();

 if (judge(i, j))
 {
  if (1 == whoseTurn % 2)
  {
   printf("Winner is player 1!\n");
   exit(0);
  }
  else
  {
   printf("Winner is player 2!\n");
   exit(0);
  }
 }
}

int judge(int x, int y)
{
 int i, j;
 int t = 2 - whoseTurn % 2;

 for (i = x - 4, j = y; i <= x; i++)
 {
  if (i >= 1 && i <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j] && t == chessboard[i + 2][j] && t == chessboard[i + 3][j] && t == chessboard[i + 4][j])
   return 1;
 }
 for (i = x, j = y - 4; j <= y; j++)
 {
  if (j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i][j + 1] && t == chessboard[i][j + 1] && t == chessboard[i][j + 3] && t == chessboard[i][j + 4])
   return 1;
 }
 for (i = x - 4, j = y - 4; i <= x, j <= y; i++, j++)
 {
  if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j + 1] && t == chessboard[i + 2][j + 2] && t == chessboard[i + 3][j + 3] && t == chessboard[i + 4][j + 4])
   return 1;
 }
 for (i = x + 4, j = y - 4; i >= 1, j <= y; i--, j++)
 {
  if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i - 1][j + 1] && t == chessboard[i - 2][j + 2] && t == chessboard[i - 3][j + 3] && t == chessboard[i - 4][j + 4])
   return 1;
 }

 return 0;
}

C語言實(shí)現(xiàn)五子棋小游戲

# include<stdio.h>
# include<stdio.h>
# include<stdio.h>
# include<stdio.h>//插入輸入輸出頭文件
# include<string.h>//字符數(shù)組的函數(shù)定義的頭文件
# include<stdlib.h>//stdlib 頭文件即standard library標(biāo)準(zhǔn)庫頭文件stdlib 頭文件里包含了C、C++語言的最常用的系統(tǒng)函數(shù)該 ,文件包含了C語言標(biāo)準(zhǔn)庫函數(shù)的定義.
# define SPA 0//在C或C++語言源程序中允許用一個(gè)標(biāo)識(shí)符來表示一個(gè)字符串，稱為“宏”。 “define”為宏定義命令。
# define MAN 1
# define COM 2
 /* 空位置設(shè)為0 ，玩家下的位置設(shè)為1 ，電腦下的位置設(shè)為2 */
#define ORDEX 15
int qipan[ORDEX][ORDEX]; //自己定義的預(yù)處理函數(shù)，以二維數(shù)組形式構(gòu)建棋盤 /* 15*15的棋盤 */

typedef struct//typedef的作用是在C中定義一個(gè)結(jié)構(gòu)體類型
{
 int iFlag;
 int iX, iY;
}ScmPiece;
int g_iPieceLen;
ScmPiece g_ScmGame1, g_ScmGame2;

void start(); /* 程序的主要控制函數(shù) */
void draw(); /* 畫棋盤 */
int Victory( ScmPiece * pScmPiece ); /* 判斷勝利 p q為判斷點(diǎn)坐標(biāo) */
void AI(int *p,int *q);  /* 電腦下子 p q返回下子坐標(biāo) */
int value(int p,int q);  /* 計(jì)算空點(diǎn)p q的價(jià)值 */
int qixing(int n,int p,int q); /* 返回空點(diǎn)p q在n方向上的棋型 n為1-8方向 從右順時(shí)針開始數(shù) */
void yiwei(int n,int *i,int *j); /* 在n方向上對(duì)坐標(biāo) i j 移位 n為1-8方向 從右順時(shí)針開始數(shù) */

void InitGame(){
 int i;
 g_iPieceLen = ORDEX * ORDEX;
 g_ScmGame1.iX = 0;
 g_ScmGame1.iY = 0;
 g_ScmGame1.iFlag = COM;
 g_ScmGame2.iX = 7;
 g_ScmGame2.iY = 7;
 g_ScmGame2.iFlag = MAN;
 for( i=0; i < ORDEX*ORDEX; ++i )
  *( (int*)qipan + i ) = SPA;
}

void main()
{
 char k;
 do{
  InitGame();
  start();
  printf("還要再來一把嗎?輸入y或n："); getchar(); scanf("%c",&k);
  while(k!='y'&&k!='n'){ printf("輸入錯(cuò)誤,請重新輸入\n"); scanf("%c",&k); }
  system("cls");
 }while(k=='y');
 printf("謝謝使用!\n");
}
void MakePiece( ScmPiece * pScmPiece, int iGameFlag ){
 if( iGameFlag )
 {
  printf("請下子：");
  while( scanf( "%d%d", &pScmPiece->iX, &pScmPiece->iY ) )
  {
   if( ( pScmPiece->iX < 0 || pScmPiece->iX > ORDEX-1 ) || ( pScmPiece->iY < 0 || pScmPiece->iY > ORDEX-1 ) )
    printf( "坐標(biāo)錯(cuò)誤!請重新輸入：");
   else if( qipan[pScmPiece->iX][pScmPiece->iY] )
    printf( "該位置已有子!請重新輸入：");
   else break;
  }
 }
 qipan[pScmPiece->iX][pScmPiece->iY] = pScmPiece->iFlag;
 --g_iPieceLen;
 system("cls");
 draw();
 if( iGameFlag == 0 )
  printf("電腦下在%d %d\n", pScmPiece->iX, pScmPiece->iY );
}
void start()
{
 int choice;
 //ScmPiece ScmGameTemp1, ScmGameTemp2;/* a1 b1儲(chǔ)存玩家上手坐標(biāo) c1 d1儲(chǔ)存電腦上手坐標(biāo) */
 printf("\t╔═══════════════════════════════╗\n");
 printf("\t║                ║\n");
 printf("\t║  歡迎使用五子棋對(duì)戰(zhàn)程序  祝您玩的愉快挑戰(zhàn)無極限  ║\n");
 printf("\t║                ║\n");
 printf("\t║     ._______________________.     ║\n"); 
 printf("\t║     | _____________________ |     ║\n");
 printf("\t║     | I     I |     ║\n");
 printf("\t║     | I     I |     ║\n");
 printf("\t║     | I  五 子 棋  I |     ║\n");
 printf("\t║     | I     I |     ║\n");
  printf("\t║     | I___________________I |     ║\n");
 printf("\t║     !_______________________!     ║\n");
  printf("\t║      ._[__________]_.       ║\n");
 printf("\t║     .___|_______________|___.     ║\n");
 printf("\t║     |::: ____    |      ║\n"); 
 printf("\t║     | ~~~~ [CD-ROM] |      ║\n");
 printf("\t║     !_____________________!      ║\n");
 printf("\t║                ║\n");
 printf("\t║                ║\n");
 printf("\t║   寒 星 溪 月 疏 星 首，花 殘 二 月 并 白 蓮。   ║\n");
 printf("\t║   雨 月 金 星 追 黑 玉，松 丘 新 宵 瑞 山 腥。   ║\n");
 printf("\t║   星 月 長 峽 恒 水 流，白 蓮 垂 俏 云 浦 嵐。   ║\n");
 printf("\t║   黑 玉 銀 月 倚 明 星，斜 月 明 月 堪 稱 朋。   ║\n");
 printf("\t║   二 十 六 局 先 棄 二，直 指 游 星 斜 彗 星。   ║\n");
 printf("\t║                ║\n");
 printf("\t║                ║\n");
 printf("\t║   1.人機(jī)對(duì)戰(zhàn)     2.人人對(duì)戰(zhàn)    ║\n");
 printf("\t║                ║\n");
 printf("\t╚═══════════════════════════════╝\n");
 printf("\t\t\t請輸入1或2：");
 while( scanf( "%d", &choice ), choice!=1 && choice!=2 )
  printf( "輸入錯(cuò)誤，請重新輸入：" );
 system("cls"); 
 if( choice == 1 )
 {         /* 人機(jī)模式 */
  printf("\t\t\t歡迎使用五子棋人機(jī)對(duì)戰(zhàn)！\n\t\t下子請輸入坐標(biāo)（如13 6）中間以空格分隔。\n\n\n"); 
  draw();
  printf("先下請按1，后下請按2：");
  while( scanf( "%d", &choice ), choice!=1 && choice!=2 )
   printf( "輸入錯(cuò) 誤，請重新輸入：" );
  if( choice == 2 )
   MakePiece( &g_ScmGame2, 0 );
  choice = 1;
 }
 else
 {
  printf("歡迎使用五子棋人人對(duì)戰(zhàn)！下子請輸入坐標(biāo)(如13 6)?；谄逭堓斎?5 15。 \n\n\n"); 
  draw();
 }
 while( g_iPieceLen )
 {
  MakePiece( &g_ScmGame1, 1 );
  if( Victory( &g_ScmGame1 ) )
  {
   printf("電腦神馬的都是浮云!!!\n");
   return;
  } /* 玩家贏 */
  if( choice == 1 )
  {
   AI( &g_ScmGame2.iY, &g_ScmGame2.iX );
   MakePiece( &g_ScmGame2, 0 );
   if( Victory( &g_ScmGame2 ) )
   {    /* 電腦贏 */
    int iChoice;
    printf("要悔棋嗎？請輸入y或n：");
STARTFLAGE:
    setbuf( stdin, NULL );
    scanf( "%c", &iChoice );
    switch( (char)iChoice ){
    case 'y':
    case 'Y':
     g_iPieceLen += 2;
     qipan[g_ScmGame2.iX][g_ScmGame2.iY] = SPA;
     qipan[g_ScmGame1.iX][g_ScmGame1.iY] = SPA;
     system("cls"); draw();
     break;
    case 'n':
    case 'N':
     printf( "下不過電腦很正常，請不要灰心!!!\n" );
     return;
    default:
     printf("輸入錯(cuò)誤，請重新輸入：");
     goto STARTFLAGE;
    }
   }
  }
  else
  {
   MakePiece( &g_ScmGame2, 1 );
   if( Victory( &g_ScmGame2 ) )
   {
    printf("電腦神馬的都是浮云!!!\n");
    return;
   }
  }
 }
 printf("和局\n");
}
void draw() /* 畫棋盤 */
{
 int i,j;
 char p[15][15][4];
 for(j=0;j<15;j++)
  for(i=0;i<15;i++){
   if(qipan[j][i]==SPA) strcpy(p[j][i]," \0");
   if(qipan[j][i]==MAN) strcpy(p[j][i],"●\0");
   if(qipan[j][i]==COM) strcpy(p[j][i],"◎\0");
  }
 printf("   0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 \n"); 
 printf("  ┌─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┬─┐\n");
 for(i=0,j=0;i<14;i++,j++){
 printf("  %2d│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%d\n",j,p[i][0],p[i][1],p[i][2],p[i][3],p[i][4],p[i][5],p[i][6],p[i][7],p[i][8],p[i][9],p[i][10],p[i][11],p[i][12],p[i][13],p[i][14],j);
 printf("  ├─┼─┼─┼─┼─┼─┼─┼─┼─┼─┼─┼─┼─┼─┼─┤\n");
 }
 printf("  14│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│%s│0\n",p[14][0],p[14][1],p[14][2],p[14][3],p[14][4],p[14][5],p[14][6],p[14][7],p[14][8],p[14][9],p[14][10],p[14][11],p[14][12],p[14][13],p[14][14]);
 printf("  └─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┴─┘\n");
 printf("   0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 \n");
}
static int DirectionValue( int * piX, int * piY, int iDirection ){
 switch( iDirection ){
 case 0:
  --*piX;
  break;
 case 4:
  ++*piX;
  break;
 case 1:
  --*piY;
  break;
 case 5:
  ++*piY;
  break;
 case 2:
  --*piX; --*piY;
  break;
 case 6:
  ++*piX; ++*piY;
  break;
 case 3:
  --*piX; ++*piY;
  break;
 case 7:
   ++*piX; --*piY;
  break;
 }
 if( (*piX >= 0 && *piX <= ORDEX-1) && (*piY >= 0 && *piY <= ORDEX-1) )
  return 1;
 else return 0;
}
static int SubVictory( ScmPiece * pScmPiece, int iDirection ){
 int iX = pScmPiece->iX;
 int iY = pScmPiece->iY;
 int iPieceCount = 1;
 while( DirectionValue( &iX, &iY, iDirection ) && qipan[iX][iY] == pScmPiece->iFlag )
  ++iPieceCount;
 iX = pScmPiece->iX;
 iY = pScmPiece->iY;
 while( DirectionValue( &iX, &iY, iDirection+4 ) && qipan[iX][iY] == pScmPiece->iFlag )
  ++iPieceCount;
 return iPieceCount;
}
int Victory( ScmPiece * pScmPiece )  /* 判斷勝利 p q為判斷點(diǎn)坐標(biāo)，勝利返回1，否則返回0 */
{
 int iDirection = 0;
 while( iDirection < 4 )
  if( SubVictory( pScmPiece, iDirection++ ) >= 5 )
   return 1;
 return 0;
}
void AI(int *p,int *q)   /* 電腦下子 *p *q返回下子坐標(biāo) */
{
 int i,j,k,max=0,I,J;  /* I J為下點(diǎn)坐標(biāo) */
 for(j=0;j<15;j++)
  for(i=0;i<15;i++)
   if(qipan[j][i]==SPA){  /* 歷遍棋盤，遇到空點(diǎn)則計(jì)算價(jià)值，取最大價(jià)值點(diǎn)下子。 */
    k=value(i,j);
    if(k>=max) { I=i; J=j; max=k; }
   }
 *p=I; *q=J;
}
int value(int p,int q) /* 計(jì)算空點(diǎn)p q的價(jià)值 以k返回 */ 
{
 int n=1,k=0,k1,k2,K1,K2,X1,Y1,Z1,X2,Y2,Z2,temp; 
 int a[2][4][4]={40,400,3000,10000,6,10,600,10000,20,120,200,0,6,10,500,0,30,300,2500,5000,2,8,300,8000,26,160,0,0,4,20,300,0};
   /* 數(shù)組a中儲(chǔ)存己方和對(duì)方共32種棋型的值 己方0對(duì)方1 活0沖1空活2空沖3 子數(shù)0-3（0表示1個(gè)子，3表示4個(gè)子） */
 while(n!=5){
  k1=qixing(n,p,q); n+=4;   /* k1,k2為2個(gè)反方向的棋型編號(hào) */
  k2=qixing(n,p,q); n-=3;
  if(k1>k2) { temp=k1; k1=k2; k2=temp; } /* 使編號(hào)小的為k1,大的為k2 */
  K1=k1; K2=k2;  /* K1 K2儲(chǔ)存k1 k2的編號(hào) */
  Z1=k1%10; Z2=k2%10; k1/=10; k2/=10; Y1=k1%10; Y2=k2%10; k1/=10; k2/=10; X1=k1%10; X2=k2%10;
   /* X Y Z分別表示 己方0對(duì)方1 活0沖1空活2空沖3 子數(shù)0-3（0表示1個(gè)子，3表示4個(gè)子） */
  if(K1==-1) { if(K2<0) { k+=0; continue; } else k+=a[X2][Y2][Z2]+5; continue; }; /* 空棋型and其他 */
  if(K1==-2) { if(K2<0) { k+=0; continue; } else k+=a[X2][Y2][Z2]/2; continue; };  /* 邊界沖棋型and其他 */ 
  if(K1==-3) { if(K2<0) { k+=0; continue; } else k+=a[X2][Y2][Z2]/3; continue; }; /* 邊界空沖棋型and其他 */ 
  if(((K1>-1&&K1<4)&&((K2>-1&&K2<4)||(K2>9&&K2<14)))||((K1>99&&K1<104)&&((K2>99&&K2<104)||(K2>109&&K2<114)))){
   /* 己活己活 己活己沖 對(duì)活對(duì)活 對(duì)活對(duì)沖 的棋型賦值*/
   if(Z1+Z2>=2) { k+=a[X2][Y2][3]; continue; }
   else { k+=a[X2][Y2][Z1+Z2+1]; continue; }
  }
  if(((K1>9&&K1<14)&&(K2>9&&K2<14))||((K1>109&&K1<114)&&(K2>109&&K2<114))){
   /* 己沖己沖 對(duì)沖對(duì)沖 的棋型賦值*/
   if(Z1+Z2>=2) { k+=10000; continue; }
   else { k+=0; continue; }
  }
  if(((K1>-1&&K1<4)&&((K2>99&&K2<104)||(K2>109&&K2<114)))||((K1>9&&K1<14)&&((K2>99&&K2<104)||(K2>109&&K2<1 14)))){
   /* 己活對(duì)活 己活對(duì)沖 己沖對(duì)活 己沖對(duì)沖 的棋型賦值*/
   if(Z1==3||Z2==3) { k+=10000; continue; }
   else { k+=a[X2][Y2][Z2]+a[X1][Y1][Z1]/4; continue; } 
  }
  else { k+=a[X1][Y1][Z1]+a[X2][Y2][Z2]; continue; } /* 其他棋型的賦值 */
 }
 return k;
}
int qixing(int n,int p,int q)   /* 返回空點(diǎn)p q在n方向上的棋型號(hào) n為1-8方向 從右順時(shí)針開始數(shù) */ 
{
 int k,m=0; /* 棋型號(hào)注解: 己活000-003 己沖010-013 對(duì)活100-103 對(duì)沖110-113 己空活020-023 己空沖030-033 對(duì)空活120-123 對(duì)空沖130-133 空-1 邊界沖-2 邊界空沖-3*/
 yiwei(n,&p,&q);
 if(p<0||p>14||q<0||q>14) k=-2;          /* 邊界沖棋型 */
 switch(qipan[q][p]){
  case COM:{
     m++; yiwei(n,&p,&q);
     if(p<0||p>14||q<0||q>14) { k=m+9; return k; }
     while(qipan[q][p]==COM) { m++; yiwei(n,&p,&q); if(p<0||p>14||q<0||q>14) { k=m+9; return k; } }
     if(qipan[q][p]==SPA) k=m-1;       /* 己方活棋型 */
      else k=m+9;           /* 己方?jīng)_棋型 */
     }break;
  case MAN:{
     m++; yiwei(n,&p,&q);
     if(p<0||p>14||q<0||q>14) { k=m+109; return k; }
     while(qipan[q][p]==MAN) { m++; yiwei(n,&p,&q); if(p<0||p>14||q<0||q>14) { k=m+109; return k; } }
     if(qipan[q][p]==SPA) k=m+99;       /* 對(duì)方活棋型 */
     else k=m+109;          /* 對(duì)方?jīng)_棋型 */
     }break;
  case SPA:{
     yiwei(n,&p,&q);
     if(p<0||p>14||q<0||q>14) { k=-3; return k; }   /* 邊界空沖棋型 */
     switch(qipan[q][p]){
     case COM:{
        m++; yiwei(n,&p,&q);
        if(p<0||p>14||q<0||q>14) { k=m+29; return k; }
        while(qipan[q][p]==COM) { m++; yiwei(n,&p,&q); if(p<0||p>14||q<0||q>14) { k=m+29; return k; } }
        if(qipan[q][p]==SPA) k=m+19;      /* 己方空活棋型 */
        else k=m+29;          /* 己方空沖棋型 */
        }break;
     case MAN:{
        m++; yiwei(n,&p,&q);
        if(p<0||p>14||q<0||q>14) { k=m+129; return k; }
        while(qipan[q][p]==MAN) { m++; yiwei(n,&p,&q); if(p<0||p>14||q<0||q>14) { k=m+129; return k; } }   
        if(qipan[q][p]==SPA) k=m+119;      /* 對(duì)方空活棋型 */
        else k=m+129;          /* 對(duì)方空沖棋型 */ 
        }break;
     case SPA: k=-1; break;           /* 空棋型 */
     }
    }break;
 }
 return k;
}
void yiwei(int n,int *i,int *j)  /* 在n方向上對(duì)坐標(biāo) i j 移位 n為1-8方向 從右順時(shí)針開始數(shù) */
{
 switch(n){
 case 1: *i+=1; break;
 case 2: *i+=1; *j+=1; break;
 case 3: *j+=1; break;
 case 4: *i-=1; *j+=1; break;
 case 5: *i-=1; break;
 case 6: *i-=1; *j-=1; break;
 case 7: *j-=1; break;
 case 8: *i+=1; *j-=1; break;
 }
}