Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - CALL
Search - CALL - List
TC3.0下编译,98下运行(因为直接调用中断中的鼠标) 放在c:\windows\desktop\wzq下 也就是把程序烤到98桌面上去 运行wzq.exe的时候必须有egavga.bgi 和 hzk16在同一目录-TC3.0 compiler, running under 98 (as a direct call interrupted the mouse) on c : \ windows \ desktop \ wzq is under the procedures bake up to 98 desktop operating wzq.exe must have the time and hzk16 egavga.bgi in the same directory
Date : 2025-12-25 Size : 369kb User : 偶亦人

在网上看了不少关于扑克牌组件的编写,大多是调用Windows/system32下的cards.dll其实我们如果不调用这些函数也是可以作一个很好扑克牌组件。-online poker read many components of the preparation, most of the calls Windows/system32 cards.dll fact that if we do not call these functions would also be a very good poker components.
Date : 2025-12-25 Size : 2kb User : 陈修

该模块能完成输入棋局的棋局异常或走棋违规判断.使用方法:把引擎头文件和智 能对弈程序IntelligentChess.h一起拷到所建文件目录下,通过“工程”菜单把引擎头文件和智能对弈程序IntelligentChess.h一起加入工程, 用#include "IntelligentChess.h"语句把智能对弈程序IntelligentChess.h加入该工程.cpp文件。然后调用各功能函数完成异常、违规判断该项目系在Visual Studio.net 2003下所建的Win32控制台项目(使用其它版本的编译器只需新建一个Win32控制台项目,然后逐一加入所有的. cpp文件和.h文件即可),其目的只是建立智能对弈棋局违规,异常判断程序模块,并不具备别的功能。-The module can be imported complete game of the game of chess, or go abnormal irregularities judgment. Use : The first engines documents and procedures IntelligentChess.h smart players together Kaodao built document head recorded, through the "works" engines menu headers and intelligent players a procedure IntelligentChess.h join the project, use# include "IntelligentChess.h" statement of intelligent players procedure In telligentChess.h to join the project. cpp document. Then call the function of abnormal function completed, judging irregularities in the Department of the project was officially built in 2003 under the control of Win32 Taiwan project (using other versions of the compiler only one new Win32 console project to be followed by all. cpp files and the. h doc
Date : 2025-12-25 Size : 838kb User : dzy

函数主要控制功能都在主函数main中实现。main函数首先清屏,调用attention函数,输出提示信息,说明游戏规则,按Y继续,按N则退出程序。接着初始化图形模式,绘制棋盘和初始棋子的位置,输出按键提示。-Function of the main control functions are in the main function main to achieve. main function of the first Qing Ping, call attention function, the output message that the rules of the game, press Y to continue, according to N has withdrawn from the program. Then initialize graphics mode, rendering the initial chess board and the location, the output button prompts.
Date : 2025-12-25 Size : 2kb User : 小白

一个小巧的扑克牌类。可以绘制扑克牌。 具体方法就是调用xp/2000自带的扑克牌Dll来绘制。-A small category of poker. Can draw poker. Specific way is to call XP/2000 own Dll to draw poker.
Date : 2025-12-25 Size : 2kb User : 黎明

这是一个用java编写的中国象棋棋谱的程序,可以对象棋棋谱进行录入,编辑,保存,调用,等操作。个人认为是比较好的程序。-This is a prepared using java chess Chinese chess procedures, can be recorded chess chess, edit, save, call, etc. to operate. Personally think is a better procedure.
Date : 2025-12-25 Size : 70kb User : 王祯

题目:八皇后问题。 八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突的放置八个皇后棋子。因为在国际象棋里,皇后的移动方式是横竖交叉,所以在任意一个皇后所在的位置的水平,竖直和斜45度都不能有其他棋子的存在。一个完整的无冲突的八皇后棋子分布成为八皇后问题的一个解。设计思路:我使用了回溯的方法来解决八皇后问题,也就是逐次试探的方法。这个方法是通过函数putchess()对自身的递归调用来实现的。运行程序后,主函数调用putchess()函数在棋盘第一行第一列上放置棋子,开始向下一行递归。每一步的递归中,首先检测待放位置有没有冲突出现,如果没有冲突,就放下棋子,并进入下一行递归,否则检测该行的下一个位置。如果整个一行中都没有可以放置的位置,就退回上一层递归。最后,如果本次放置成功,并且递归调用深度为7,就打印输出结果。-Title: Queen s eight questions. Queen s eight questions refer to how to solve the 8* 8 chess board placed on the eight conflict-free Queen s pawn. Since at chess, the Queen of the mobile means are横竖cross, so at any one location s level, vertical and inclined 45 degrees can not have other pieces exist. A complete conflict-free distribution of the eight Queen s pawn to become queen eight questions a solution. Design ideas: I use a retrospective method to solve the eight Queen s question, that is, successive test method. This method is through the function putchess () recursive calls of their own to achieve. After running the program, the main function call putchess () function at the first line of the first column of the chessboard placed on a pawn down and his party start recursion. Every step of the recursion, the first question put Detect location appears there is no conflict, if there is no conflict, it is down a pawn, and into the next line recursive, otherwise detect the locatio
Date : 2025-12-25 Size : 30kb User : cl

五子棋问题,是一个典型的递归调用的问题。该程序实现了五子棋的对弈过程,缺陷是不能实现图像处理-Gobang problem is a typical recursive call problems. The program implements the chess backgammon process, defects can not be achieved image processing
Date : 2025-12-25 Size : 2kb User : 钟世奇

21点一般用到1-8副牌。庄家给每个玩家发两张牌,牌面朝上;给自己发两张牌,一张牌面朝上(叫明牌),一张牌面朝下(叫暗牌)。大家手中扑克点数的计算是:K、Q、J 和 10 牌都算作 10 点。 A 牌既可算作1 点也可算作11 点,由玩家自己决定。其余所有2 至9 牌均按其原面值计算。首先玩家开始要牌,如果玩家拿到的前两张牌是一张 A 和一张10点牌,就拥有黑杰克 (Blackjack);此时,如果庄家没有黑杰克,玩家就能赢得2倍的赌金(1赔2)。没有黑杰克的玩家可以继续拿牌,可以随意要多少张。目的是尽量往21点靠,靠得越近越好,最好就是21点了。在要牌的过程中,如果所有的牌加起来超过21点,玩家就输了——叫爆掉(Bust),游戏也就结束了。假如玩家没爆掉,又决定不再要牌了,这时庄家就把他的那张暗牌打开来。庄家根据自己的情况拿牌,一般到17点或17点以上不再拿牌,但也有可能15到16点甚至12到13点就不再拿牌或者18到19点继续拿牌。假如庄家爆掉了,那他就输了。假如他没爆掉,那么你就与他比点数大小,大为赢。一样的点数为平手,你可以把你的赌注拿回来。-21:00 General used the cards 1-8. The dealer to each player two cards, dealt face up to their own two cards issued, a card face up (called the winning numbers), a card face down (called the dark card). We calculated the hands of poker points: K, Q, J, and 10 cards are counted as 10 points. A card can count as 1 point can also be counted as 11 points by the players to decide. All the remaining 2 to 9 licenses according to its original par value. First, players began to license, if the player got the first two cards is a A and a 10-point card to a black Jack (Blackjack) this point, if the dealer does not Black Jack, the player will win 2 times Sweepstakes (1 lost 2). Black Jack, the player can not continue to take the card, feel free to how many. Our objective is to rely on to 21:00, close together as possible, the best is 21 o clock. To license the process, if all the cards add up to more than 21 points, players lose- call ringing off the hook (Bust), the game is over. If the players
Date : 2025-12-25 Size : 2kb User : 灏潍

调用windows API,使用基于UDP的异步套接字,实现了一个简单的五子棋网络版-Call the windows API, using UDP-based asynchronous sockets to achieve a simple online backgammon
Date : 2025-12-25 Size : 2.88mb User : xiao

象棋游戏程序采用的就是递归算法递归算法是把问题转化为规模缩小了的同类问题的子问题。然后递归调用函数(或过程)来表示问题的解 -Chess game procedures used is the recursive algorithm. The algorithm is put into the scale of the narrowing of the same problem problem. Then the recursive function call ( or process ) to represent the solution of the problem
Date : 2025-12-25 Size : 7kb User : 朵拉

五子棋。界面不太友好。。。 代码里有注释,相应的改一下就可以有随机下子,人工下子和电脑下子三种模式的六种组合。 位置一位置二中调用的函数: 电脑下 diannaoxia(a,35,48) 随机下 suijixia(a,35) 人下 renxia(a,35) 其中43 48 什么的都是阿斯托码值。。35对应 # 43对应 + 48对应 0 诸如此类为显示棋盘时用的符号 然后注释 空白 的是宏定义的棋盘上的空白位置。。。机机对战时用空白比较好看。。。人下的话可以用 43 ,比较好数格子-Backgammon. Interface is not very friendly. . . Code annotated, the corresponding change can have a random Now, six combinations of computers and artificial erupted erupted in three modes. Position a position to call two functions:                                                       Computer diannaoxia under (a, 35,48)                                                       Random under suijixia (a, 35)                                                       Person under renxia (a, 35) What is one of 4348 Astor code value. . 35 corresponding to the # 43 corresponds to + 48 corresponds to 0 like the display board for the use of symbols Then note the pos
Date : 2025-12-25 Size : 229kb User : 李程序

局域网中国象棋源码,此源码为毕业设计,附件包括详细设计方案,论文等资料. 棋盘: 利用PhotoShop绘制出带底纹的棋盘。并将其映射到窗口的范围。 棋子: 调用绘图函数Ellipse()和TextOut()绘制棋子。 使用WM_PAINT消息响应完成对窗口的重绘。 网络连接: 利用socket套接字进行连接,绑定端口号为5050。 联机代码: 联机使用专用代码10000表示邀请、10001表示接受、10002表示退出。-LAN Chinese chess source code, the source for graduation design, detailed design, including accessories, papers and other information. Board:             Use PhotoShop to map out the board with shading. And map it to the range of the window. Pieces:         Call the drawing function Ellipse () and TextOut () to draw the pieces.         Use WM_PAINT message response complete redraw the window. Network connection:             Socket socket to connect, bind port number is 5050. Online code:         Online using a dedicated code 10000 indicates an invitation, acceptance 10001, 10002, said exit.
Date : 2025-12-25 Size : 2.83mb User : 神之子

调用windows里面的Cards.dll显示扑克牌,用LoadLibrary的方式,参考了pudn的kdjl代码.-Call windows inside Cards.dll display cards with LoadLibrary way to reference the pudn of kdjl code.
Date : 2025-12-25 Size : 133kb User : hewen

2345军棋游戏,相类似2345小游戏,提供了一个游戏窗口和四个键值,游戏里还有一些bug,到时发现,请指出来-2345cheese game ,which copy the website call QQhub ,it provide the window , the four sbit value that enable to play ,and the game still have some bug ,so ,when you found it ,please point it ,and release to me.
Date : 2025-12-25 Size : 15kb User : 林泽峰

斗地主出牌提示lua脚本。 test.lua中写了一个调用测试的方法。 假设自己手牌为3,4,5.对放打出3,提示出牌4或者5-Landlords cards prompt lua script. test.lua write a method call test. Suppose own hand as 3,4,5. To put hit 3, 4 or 5 prompted the cards
Date : 2025-12-25 Size : 5kb User : 继光

本项目是一款单机版本斗地主游戏源码,应该说这个游戏太强大了,是一款android上的手机游戏,可以与手机进行发牌,洗牌,出牌等动作,还可以叫地主,等 可以学习下Canvas的功能,很多游戏场景都是基于Canvas画出来的。本项目UI设计的也很炫,项目中代码层次分明,大部分方法都加了详细的注释。(项目采用GBK编码)。-This project is a stand-alone version of the Landlords game source code should be said the game too strong, is a Android mobile game, and mobile phone licensing, shuffle, cards and other movements, can also call the landlord, etc. Can learn the function of Canvas, a lot of the game scene is based on the Canvas draw out. UI design of the project is also very Hyun, the project code levels are clear, most of the methods have added a detailed notes. (project using GBK code).
Date : 2025-12-25 Size : 22.38mb User : wangyd

易语言源码例程程序结合易语言扩展界面支持库和多线程支持库,调用动画框和动画物体组件实现象棋游戏。-Easy language source code routine program combined with easy language extension interface support library and multi-threading support library, call animation frame and animation object component to realize chess game.
Date : 2025-12-25 Size : 347kb User : lil

你将实现两个玩家版本。一名玩家将是计算机,另一名玩家是您程序的用户。让我们将电脑玩家称为机器人和用户玩家作为人。你可以假设机器人总是处理这些卡片。(You will implement two player versions. One player will be a computer and the other player will be the user of your program. Let's call computer players robots and user players as people. You can assume that the robot always handles these cards.)
Date : 2025-12-25 Size : 2kb User : jliu331

//使用方法: //首先创建m_pRobot = new CRobot()对象 //叫分: //1.初始化手牌到m_pRobot->m_szHandCards数组,手牌按牌面从小到大排序,例:200,300,101,201,102,403,205,311,210,310....,注意数组大小,不要有空值或者0值 //2.调用解析函数m_pRobot->Resolution(); //3.获取叫分m_pRobot->getCallF(),返回0不叫,1一倍 2两倍 3三倍 //出牌: //1.初始化手牌到m_pRobot->m_szHandCards数组 //2.调用解析函数m_pRobot->Resolution(); //3.设置牌池中的出牌数据: //a.m_pRobot->m_nLastPutCardIndex最后那个出牌人的座位号[0,1,2] //b.m_pRobot->m_nLastPutCardNum牌池内牌型有多少张 //c.m_pRobot->m_szLastPutCard牌池内牌型,按牌面从小到大排序(// Method of use: // First create m_pRobot = new CRobot () object / / points: Initialize the hand to the m_pRobot-> m_szHandCards array. Hands are sorted from small to large, for example: 200, 300, 101, 201, 102, 403, 205, 311, 210, 310.... Pay attention to the size of the array. Do not have empty or zero values. //2. Call the analytic function m_pRobot - > Resolution (); //3. Get m_pRobot - > getCallF (), return 0 no call, double 2 times 3 times / / playing cards: //1. Initialize the hand to the m_pRobot-> m_szHandCards array //2. Call the analytic function m_pRobot - > Resolution (); //3. Set the license data in the pool: //a.m_pRobot-> m_nLastPutCardIndex Last Player's Seat Number [0,1,2] //b.m_pRobot-> m_nLastPutCardNum pool number of cards //c.m_pRobot-> m_szLastPutCard pool type, sorted from small to large)
Date : 2025-12-25 Size : 12kb User : Los瘦身
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.