代码搜索:ChessBoard

找到约 642 项符合「ChessBoard」的源代码

代码结果 642
www.eeworm.com/read/184793/9075147

txt 棋盘覆盖问题.txt

void chessboard(int tr,int tc,int dr,int dc,int size) { if(size==1) return; int t=tile++, //L型骨牌号 s=size/2; //分割棋盘 //覆盖左上角子棋盘 if(dr
www.eeworm.com/read/361582/10044398

txt 棋盘.txt

using System; class ChessBoard { public char[,] SquareColor=new char [8,8]; public ChessBoard() { for(int i=0;i
www.eeworm.com/read/164186/10123820

java chesspoint.java

public class ChessPoint { int x,y; boolean 有棋子; ChessPiece piece=null; ChessBoard board=null; public ChessPoint(int x,int y,boolean boo) { this.x=x; this.y=y;
www.eeworm.com/read/422955/10599264

cpp _chessb.cpp

//此文件定义了棋盘类 #include "_ChessB.h" #include #include #include #include /* 棋盘的初始化,参数为棋盘所在区域左上角的横、纵坐标和该区域的高度、宽度 */ _ChessBoard::_ChessBoard(int left,int to
www.eeworm.com/read/159031/10700123

java chesspoint.java

public class ChessPoint { int x,y; boolean 有棋子; ChessPiece piece=null; ChessBoard board=null; public ChessPoint(int x,int y,boolean boo) { this.x=x; this.y=y;
www.eeworm.com/read/349332/10835082

txt 棋盘.txt

using System; class ChessBoard { public char[,] SquareColor=new char [8,8]; public ChessBoard() { for(int i=0;i
www.eeworm.com/read/469995/6922219

java queen.java

//The class to represent the 8*8 chessboard class chessboard{ int [][]board = new int[8][8]; int printCount = 0; //Initialization chessboard(){ for(int i = 0; i < 8 ; i++) for(
www.eeworm.com/read/246340/6964376

java chesspoint.java

public class ChessPoint { int x,y; boolean 有棋子; ChessPiece piece=null; ChessBoard board=null; public ChessPoint(int x,int y,boolean boo) { this.x=x; this.y=y;
www.eeworm.com/read/466590/7029405

cpp evaluate.cpp

#include #include "Cdefines.h" #include "Global.h" #undef max #undef min #define max(a, b) (((a) > (b)) ? (a) : (b)) #define min(a, b) (((a) < (b)) ? (a) : (b)) #define TOLE
www.eeworm.com/read/466590/7029417

cpp treesearch.cpp

#include #include "MainForm1.h" #include "CDefines.h" #include "Chess.h" #include "Global.h" #undef max #undef min #define max(a, b) (((a) > (b)) ? (a) : (b)) #define min(a, b) (