登录
首页 » Visual C++ » Tic-tac-toe-chess

Tic-tac-toe-chess

于 2012-05-20 发布 文件大小:305KB
0 208
下载积分: 1 下载次数: 19

代码说明:

  C语言实现井字棋博弈的过程,采用极大极小算法。(The C language game of tic-tac-toe chess, using the minimax algorithm.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Function-parameters
    C语言插入排序算法及代码 C语言中函数参数的传递有:值传递、地址传递、引用传递这三种形式。题一为值传递,题二为地址传递,题三为引用传递。(Insertion sort algorithm and C language code The parameter of function in C language transfer: transfer value, address, pass by reference to these three forms. Problem a value transfer, the transfer of Title address, three for reference. )
    2014-06-30 21:28:28下载
    积分:1
  • yinhangjiasuanfa
    一个很好的银行家算法,能运行(A good banker s algorithm, will be able to run)
    2008-06-14 13:44:24下载
    积分:1
  • calculation
    数据结构计算算术表达式算法,可以计算小数点及较复杂的运算表达式(Data structure algorithms calculate arithmetic expression, we can calculate the decimal point and more complex operations expression)
    2010-12-24 13:11:25下载
    积分:1
  • data-structure-paper
    本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
    2013-09-18 08:16:24下载
    积分:1
  • LR(0)
    简单LR语法分析程序自动生成器的实现,可用作数据结构课程设计(LR (0) grammar analysis)
    2013-09-22 09:26:25下载
    积分:1
  • C1
    说明:  由C程序实现的 数学上 滑雪问题 的代码实现,供大家学习用(Ski problem code for all to learn to use)
    2011-05-28 14:51:40下载
    积分:1
  • migong
    迷宫问题,利用随机数自动生成迷宫,并自动进行探索。迷宫起点及终点由用户自己设定。(Maze problem, the use of random number automatically generated maze, and automatically explore. The starting point and end point of the maze is set by the user. 双语对照 )
    2021-04-26 16:48:45下载
    积分:1
  • 约瑟夫环的循环链表实现
    约瑟夫环的循环链表实现,这个程序比较完整,有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)
    2005-07-03 19:38:38下载
    积分:1
  • heapSort.cpp.tar
    这是一个堆排序的算法源程序,算法被单独写成一个函数,希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)
    2013-12-12 14:52:48下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • 696518资源总数
  • 106222会员总数
  • 14今日下载