一个很经典的井字棋游戏 Pascal源码Chaobs奉上

注意:1.有的FP版本不支持汉语,将会出现乱码。2.别想赢电脑了,平手不错了。

井字过三关:

program TicTacToe;

uses crt;

var

a:Array [1..3] of Array [1..3] of char;

b:Array [1..3] of Array [1..3] of integer;

i,n,g,e,p:integer;

t:text;

c:char;

o:integer;

r:integer;

s,h:integer;

ch,cal,ek,ck,hc:integer;

time:integer;

label xh,exit1;

begin

randomize;

clrscr;

writeln('1',chr(179),'2',chr(179),'3');

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln('4',chr(179),'5',chr(179),'6');

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln('7',chr(179),'8',chr(179),'9');

writeln('press enter');

readln;

xh:

ek:=0;

repeat

repeat

clrscr;

if ek=1 then writeln('wrong');

case b[1,1] of

0:a[1,1]:=' ';

1:a[1,1]:='o';

2:a[1,1]:='x';

end;

case b[1,2] of

0:a[1,2]:=' ';

1:a[1,2]:='o';

2:a[1,2]:='x';

end;

case b[1,3] of

0:a[1,3]:=' ';

1:a[1,3]:='o';

2:a[1,3]:='x';

end;

case b[2,1] of

0:a[2,1]:=' ';

1:a[2,1]:='o';

2:a[2,1]:='x';

end;

case b[2,2] of

0:a[2,2]:=' ';

1:a[2,2]:='o';

2:a[2,2]:='x';

end;

case b[2,3] of

0:a[2,3]:=' ';

1:a[2,3]:='o';

2:a[2,3]:='x';

end;

case b[3,1] of

0:a[3,1]:=' ';

1:a[3,1]:='o';

2:a[3,1]:='x';

end;

case b[3,2] of

0:a[3,2]:=' ';

1:a[3,2]:='o';

2:a[3,2]:='x';

end;

case b[3,3] of

0:a[3,3]:=' ';

1:a[3,3]:='o';

2:a[3,3]:='x';

end;

writeln(a[1,1],chr(179),a[1,2],chr(179),a[1,3]);

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln(a[2,1],chr(179),a[2,2],chr(179),a[2,3]);

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln(a[3,1],chr(179),a[3,2],chr(179),a[3,3]);

write('press location');

c:=readkey;

if c='e' then

begin

ch:=3;

goto exit1;

end;

o:=ord(c);

p:=o-48;

case p of

1,2,3:g:=1;

4,5,6:g:=2;

7,8,9:g:=3;

end;

e:=o mod 3;

if e=0 then e:=3;

writeln;

ek:=1;

until ((c='0') or (c='1') or (c='2') or (c='3') or (c='4')

or (c='5') or (c='6') or (c='7') or (c='8') or (c='9'));

until (a[g,e]<>'x') and (a[g,e]<>'o');

time:=time+1;

if c='1' then b[1,1]:=1;

if c='2' then b[1,2]:=1;

if c='3' then b[1,3]:=1;

if c='4' then b[2,1]:=1;

if c='5' then b[2,2]:=1;

if c='6' then b[2,3]:=1;

if c='7' then b[3,1]:=1;

if c='8' then b[3,2]:=1;

if c='9' then b[3,3]:=1;

clrscr;

for s:=1 to 3 do begin

for h:=1 to 3 do begin

if b[s,h]=1 then write('o');

if b[s,h]=2 then write('x');

if (b[s,h]<>1) and (b[s,h]<>2) then write(' ');

if h<>3 then write(chr(179));

end;

writeln;

if s<>3 then writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

end;

if ((b[1,2]=1) and (b[2,2]=1) and (b[3,2]=1))

or ((b[1,1]=1) and (b[1,2]=1) and (b[1,3]=1))

or ((b[2,1]=1) and (b[2,2]=1) and (b[2,3]=1))

or ((b[3,1]=1) and (b[3,2]=1) and (b[3,3]=1))

or ((b[1,1]=1) and (b[2,1]=1) and (b[3,1]=1))

or ((b[1,3]=1) and (b[2,3]=1) and (b[3,3]=1))

or ((b[1,1]=1) and (b[2,2]=1) and (b[3,3]=1))

or ((b[1,3]=1) and (b[2,2]=1) and (b[3,1]=1))

then begin ch:=1; goto exit1; end;

cal:=0;

for s:=1 to 3 do begin

for h:=1 to 3 do begin

if (b[s,h]=1) or (b[s,h]=2) then cal:=cal+1;

end;

end;

if cal=9 then goto exit1;

writeln('press enter');

readln;

repeat

hc:=0;

ck:=0;

if (((b[1,2]=2) and (b[1,3]=2))

or ((b[2,1]=2) and (b[3,1]=2))

or ((b[2,2]=2) and (b[3,3]=2)))

and (b[1,1]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=1;

end;

if (((b[1,1]=2) and (b[1,3]=2))

or ((b[2,2]=2) and (b[3,2]=2)))

and (b[1,2]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=2;

end;

if (((b[1,1]=2) and (b[1,2]=2))

or ((b[2,3]=2) and (b[3,3]=2))

or ((b[2,2]=2) and (b[3,1]=2)))

and (b[1,3]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=3;

end;

if (((b[1,1]=2) and (b[3,1]=2))

or ((b[2,2]=2) and (b[2,3]=2)))

and (b[2,1]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=4;

end;

if (((b[1,1]=2) and (b[3,3]=2))

or ((b[1,3]=2) and (b[3,1]=2))

or ((b[1,2]=2) and (b[3,2]=2))

or ((b[2,1]=2) and (b[2,3]=2)))

and (b[2,2]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=5;

end;

if (((b[2,1]=2) and (b[2,2]=2))

or ((b[1,3]=2) and (b[3,3]=2)))

and (b[2,3]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=6;

end;

if (((b[1,1]=2) and (b[2,1]=2))

or ((b[3,2]=2) and (b[3,3]=2))

or ((b[1,3]=2) and (b[2,2]=2)))

and (b[3,1]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=7;

end;

if (((b[1,2]=2) and (b[2,2]=2))

or ((b[3,1]=2) and (b[3,3]=2)))

and (b[3,2]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=8;

end;

if (((b[1,1]=2) and (b[2,2]=2))

or ((b[1,3]=2) and (b[2,3]=2))

or ((b[1,1]=2) and (b[2,2]=2)))

and (b[3,3]<>1) then

begin

hc:=1;

ck:=ck+1;

r:=9;

end;

if hc=0 then begin

if time=1 then begin

if c='5' then r:=1;

if c<>'5' then r:=5;

end

else

begin

if (((b[1,2]=1) and (b[1,3]=1))

or ((b[2,1]=1) and (b[3,1]=1))

or ((b[2,2]=1) and (b[3,3]=1)))

and (b[1,1]<>2) then

begin

ck:=ck+1;

r:=1;

hc:=3;

end;

if (((b[1,1]=1) and (b[1,3]=1))

or ((b[2,2]=1) and (b[3,2]=1)))

and (b[1,2]<>2) then

begin

ck:=ck+1;

r:=2;

hc:=3;

end;

if (((b[1,1]=1) and (b[1,2]=1))

or ((b[2,3]=1) and (b[3,3]=1))

or ((b[2,2]=1) and (b[3,1]=1)))

and (b[1,3]<>2) then

begin

ck:=ck+1;

ck:=ck+1;

r:=3;

hc:=3;

end;

if (((b[1,1]=1) and (b[3,1]=1))

or ((b[2,2]=1) and (b[2,3]=1)))

and (b[2,1]<>2) then

begin

ck:=ck+1;

r:=4;

hc:=3;

end;

if (((b[1,1]=1) and (b[3,3]=1))

or ((b[1,3]=1) and (b[3,1]=1))

or ((b[1,2]=1) and (b[3,2]=1))

or ((b[2,1]=1) and (b[2,3]=1)))

and (b[2,2]<>2) then

begin

ck:=ck+1;

r:=5;

hc:=3;

end;

if (((b[2,1]=1) and (b[2,2]=1))

or ((b[1,3]=1) and (b[3,3]=1)))

and (b[2,3]<>2) then

begin

ck:=ck+1;

r:=6;

hc:=3;

end;

if (((b[1,1]=1) and (b[2,1]=1))

or ((b[3,2]=1) and (b[3,3]=1))

or ((b[1,3]=1) and (b[2,2]=1)))

and (b[3,1]<>2) then

begin

ck:=ck+1;

r:=7;

hc:=3;

end;

if (((b[1,2]=1) and (b[2,2]=1))

or ((b[3,1]=1) and (b[3,3]=1)))

and (b[3,2]<>2) then

begin

ck:=ck+1;

r:=8;

hc:=3;

end;

if (((b[1,1]=1) and (b[2,2]=1))

or ((b[1,3]=1) and (b[2,3]=1))

or ((b[1,1]=1) and (b[2,2]=1)))

and (b[3,3]<>2) then

begin

ck:=ck+1;

r:=9;

hc:=3;

end;

end;{else}

end;{if}

if ek>1 then writeln('you can be the winner');

if hc=0 then r:=random(9);

if time=1 then begin

if c='5' then r:=1;

if c<>'5' then r:=5;

end;

i:=r mod 3;

case r of

1,2,3:n:=1;

4,5,6:n:=2;

7,8,9:n:=3;

end;

if i=0 then i:=3;

writeln;

until (b[n,i]<>1) and (b[n,i]<>2) and (r<>0);

b[n,i]:=2;

clrscr;

case b[1,1] of

0:a[1,1]:=' ';

1:a[1,1]:='o';

2:a[1,1]:='x';

end;

case b[1,2] of

0:a[1,2]:=' ';

1:a[1,2]:='o';

2:a[1,2]:='x';

end;

case b[1,3] of

0:a[1,3]:=' ';

1:a[1,3]:='o';

2:a[1,3]:='x';

end;

case b[2,1] of

0:a[2,1]:=' ';

1:a[2,1]:='o';

2:a[2,1]:='x';

end;

case b[2,2] of

0:a[2,2]:=' ';

1:a[2,2]:='o';

2:a[2,2]:='x';

end;

case b[2,3] of

0:a[2,3]:=' ';

1:a[2,3]:='o';

2:a[2,3]:='x';

end;

case b[3,1] of

0:a[3,1]:=' ';

1:a[3,1]:='o';

2:a[3,1]:='x';

end;

case b[3,2] of

0:a[3,2]:=' ';

1:a[3,2]:='o';

2:a[3,2]:='x';

end;

case b[3,3] of

0:a[3,3]:=' ';

1:a[3,3]:='o';

2:a[3,3]:='x';

end;

writeln(a[1,1],chr(179),a[1,2],chr(179),a[1,3]);

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln(a[2,1],chr(179),a[2,2],chr(179),a[2,3]);

writeln(chr(196),chr(197),chr(196),chr(197),chr(196));

writeln(a[3,1],chr(179),a[3,2],chr(179),a[3,3]);

if ((b[1,2]=2) and (b[2,2]=2) and (b[3,2]=2))

or ((b[1,1]=2) and (b[1,2]=2) and (b[1,3]=2))

or ((b[2,1]=2) and (b[2,2]=2) and (b[2,3]=2))

or ((b[3,1]=2) and (b[3,2]=2) and (b[3,3]=2))

or ((b[1,1]=2) and (b[2,1]=2) and (b[3,1]=2))

or ((b[1,3]=2) and (b[2,3]=2) and (b[3,3]=2))

or ((b[1,1]=2) and (b[2,2]=2) and (b[3,3]=2))

or ((b[1,3]=2) and (b[2,2]=2) and (b[3,1]=2))

then begin ch:=2; goto exit1; end;

goto xh;

exit1:

if cal=9 then writeln('deuce');

if ch=2 then writeln('lost');

if ch=1 then writeln('win');

if ch=3 then

begin

clrscr;

writeln('exited');

end;

writeln('press enter');

readln;

end.

 
 这是《Pascal程序设计》上的一道作业,不知道我是不是想复杂了?管他呢,现在谁还需要这种游戏?

Pascal小游戏 井字棋的更多相关文章

  1. Java 小游戏 - 井字棋 v1.0 (初步完成) (2018.4.16更新)

      井字棋游戏初步完成 实现功能:输入位置数据->打印棋盘->判断是否胜利->继续游戏/退出游戏 缺点:没有清屏函数   判断胜利方法太过无脑    package MYGAME; ...

  2. C++小游戏——井字棋

    #include<cstdio> #include<windows.h> #include<ctime> int main() { srand(time(NULL) ...

  3. python 游戏(井字棋)

    1. 游戏思路和流程图 实现功能,现实生活中的井字棋玩法 游戏流程图 2. 使用模块和游戏提示 import random def game_info(): print('欢迎来到井字棋游戏') pr ...

  4. [HTML5实现人工智能]小游戏《井字棋》发布,据说IQ上200才能赢

    一,什么是TicTacToe(井字棋)   本 游戏 为在下用lufylegend开发的第二款小游戏.此游戏是大家想必大家小时候都玩过,因为玩它很简单,只需要一张草稿纸和一只笔就能开始游戏,所以广受儿 ...

  5. 『HTML5实现人工智能』小游戏《井字棋》发布,据说IQ上200才能赢【算法&代码讲解+资源打包下载】

    一,什么是TicTacToe(井字棋) 本游戏为在下用lufylegend开发的第二款小游戏.此游戏是大家想必大家小时候都玩过,因为玩它很简单,只需要一张草稿纸和一只笔就能开始游戏,所以广受儿童欢迎. ...

  6. 井字棋小游戏(C语言)

    最近沉迷于<NetHack>.<DCSS>等字符游戏,对其很感兴趣,于是用C语言写了个字符界面的井字棋小游戏.欢迎大家指教. 编写时遇到了一些问题,我原先准备用循环,直到读取到 ...

  7. 井字棋游戏升级版 - TopTicTacToe项目 简介

    一.游戏简介 井字棋是一款世界闻名的游戏,不用我说,你一定知道它的游戏规则. 这款游戏简单易学,玩起来很有意思,不过已经证明出这款游戏如果两个玩家都足够聪明的话, 是很容易无法分出胜负的,即我们得到的 ...

  8. [CareerCup] 17.2 Tic Tac Toe 井字棋游戏

    17.2 Design an algorithm to figure out if someone has won a game oftic-tac-toe. 这道题让我们判断玩家是否能赢井字棋游戏, ...

  9. [C++] 井字棋游戏源码

    TicTac.h #define EX 1 //该点左鼠标 #define OH 2 //该点右鼠标 class CMyApp : public CWinApp { public: virtual B ...

随机推荐

  1. cnblog编辑Latex数学公式

    Latex在线公式编辑器 http://www.codecogs.com/latex/eqneditor.php 1. 行内公式: code $ \sqrt{a^2} $ display $ \sqr ...

  2. 解决频繁自动弹出“QQ拼音升级程序”,可使用旧版QQ输入法

    QQ输入法(2017年9月6日版本)下载地址: http://dlc2.pconline.com.cn/filedown_90891_8506339/BZXMP3fp/QQPinyin_Setup_5 ...

  3. 运行npm update等命令出错后如何分析问题根源

    我今天工作时,在当前前端项目工作目录下执行命令npm update 结果遇到如下错误:registry error parsing json npm ERR! Unexpected token < ...

  4. Raknet—视频会议系统最佳的数据传输引擎

    RakNet是一个跨平台的C++和C#的游戏引擎,它主要是为高效的数据传输而设计,使用者可以通过它进行游戏和其他的程序的开发.RakNet虽然是一个游戏引擎,但同样也是一个非常好的视频会议系统传输引擎 ...

  5. soap使用xml调用webapi后返回xml信息进行JSON转换处理,以顺丰查询接口为例

    expressUrl = string.Format(可以卸载配置文件的域名URL + "/bsp-oisp/ws/expressService"); StringBuilder ...

  6. 问题 B: 投简历

    题目描述 小华历经12寒窗苦读,又经历4年大学磨砺,终于毕业了,随着毕业季的到来,找工作也日益紧张起来.由于要面试不同的公司,因此小华需要准备不同的简历.当然最基本的信息是必不可少的,基本信息:姓名. ...

  7. 手动创建maven项目+cmd+webapp+tomcat

    1.创建文件夹 2.在刚刚创建的文件夹目录下:创建一个scr文件夹和pom.xml文件 3.在pom.xml配置 <?xml version="1.0" encoding=& ...

  8. Oracle 将 A 用户下所有表的增删改查 赋予 B 用户

    第一步:创建用户 create user username identified by password; 第二步:给用户赋值接触锁定(仅仅赋予会话权限) grant create session t ...

  9. Java反射+注解案例

    注解类代码,注解的属性可以有多个: package reflect; import java.lang.annotation.Retention; import java.lang.annotatio ...

  10. 39条常见的Linux系统简单面试题

    39条常见的Linux系统简单面试题 本文主要分享39条常见的Linux系统简单面试题,其中包括如何看当前Linux系统有几颗物理CPU和每颗CPU的核数.如何实时查看网卡流量为多少等等,希望对你有所 ...