搜索资源列表
horse.round.travel
- 本程序基于对称的思想,在8*8的棋盘上寻找一条马的周游路线,用同样的方法可以扩展到其他尺寸的棋盘问题-The program is based on symmetry ideas, 8* 8 board to find a horse travel route, use the same method can be extended to other dimensions of the chessboard problem
200810139184657676
- 将马随机放在国际象棋的8×8棋盘Board[0~7][0~7]的某个方格中,马按走棋规则进行移动。要求每个方格只进入一次,走遍棋盘上全部64个方格。编制非递归程序,求出马的行走路线,并按求出的行走路线,将数字1,2,…,64依次填入一个8×8的方阵,输出之 -The horses were placed in 8 × 8 chess board Board [0 ~ 7] [0 ~ 7] in a box, the horse in accordance with the rules for
nQueens
- 人工智能课程实验:使用启发式搜索求解皇后问题。启发式搜索是利用度量作为指南的一种搜索方法。皇后问题是计算机界的经典问题,n皇后问题为把n个皇后放入一个n*n的棋盘中,使皇后两两不在同一行,同一列以及同一斜线中。求解n皇后问题的算法众多,主要有回溯法,构造法,概率算法以及本实验所用的启发式搜索方法等。方法不同,求解问题所产生的时间效率也大不相同,本实验主要对比构造法与启发式搜索方法的效率。 -Artificial Intelligence Curriculum Experiment: Usin
tm
- 用delphi编写n*n的棋盘格的跳马问题,利用贪心法和回溯法实现,得到解的速度较快-Use delphi write n* n chessboard grid of the vault, by using greedy method and backtracking achieved by faster solutions
-xrx
- 数据结构 马踏棋盘问题 C语言开发 图形界面 2009年课程设计用过的 程序+文档-Data structure Mata chessboard problem
backtrace_src
- 国际象棋中马的周游问题 给定一个8×8的棋盘,给定某一位置。求马从该位置出发,经过棋盘中的每一个方格恰好一次,最后回到它出发位置的路线图。 要求:用图形化动态演示马的行走路线、回溯过程。 -Travel chess problems in horses given a 8 × 8 chessboard, given a particular location. Horse from the starting seek position, after the board of each
fenzhi_src
- 棋盘覆盖问题 设一个n*n棋盘,n=2k,用L 型条块覆盖棋盘中除一个指定方格外的所有方格,每个L型条块可恰好覆盖3 个方格。 实验内容:设计分治算法实现棋盘覆盖,要求图形化。-Board covering the establishment of a n* n chessboard, n = 2k, with the L-slice coverage for a specified board, in addition to all the extra square grid, eac
8Queens
- 八皇后问题:设8皇后问题的解为 (x1, x2, x3, …,x8), 约束条件为:在8x8的棋盘上,其中任意两个xi 和xj不能位于棋盘的同行、同列及同对角线。要求用一位数组进行存储,输出所有可能的排列-Eight queens problem: the solution set for the 8 queens problem (x1, x2, x3, ..., x8), constraints are: 8x8 chessboard in which any two xi and xj c
code
- 以一字棋游戏为例,设计的一个3行3列的棋盘,自己给出估价函数,采用极大极小搜索方法。-To the word chess game, for example, the design of a 3 by 3 chessboard, given their valuation functions, minimax search method.
nqueen
- 在n*n格的棋盘上放置彼此不受攻击的N各皇后,皇后可以攻击与其处在同一行或同一列或同一斜线上的棋子。-Lattice in the n* n chessboard placed on each other from attacks, N the Queen, the Queen can attack with in the same row or column or diagonal on the same piece.
ma
- 给定一个8×8的棋盘,给定某一位置。求马从该位置出发,经过棋盘中的每一个方格恰好一次,最后回到它出发位置的路线图。-Given an 8 × 8 chessboard, given a particular location. Horse from the starting seek position, after the board of each square exactly once, and finally back to its starting position of the roa
chessbrd
- TChessBrd Component a chessboard
16
- 游戏规则:假设有一个像棋盘一样的方格网,每个方格中放置一个生命细胞,生命细胞只有两种状态:“生”或“死”。-Rules: if there is a like a chessboard like grid, each square place a life in the cell, life cell only two states: " Health" or " dead."
knight
- Chessboard exploring. Euristic algorithm to find a Knight path visiting all squares on Chessboard.
3
- The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture any other using the standard chess queen s moves. The queens must be placed in such a way that no two queens attack e
ChessBoard
- 分治法解决棋盘覆盖问题,采用MFC界面实现棋盘覆盖问题的直观描述-Divide and conquer method to solve the coverage problem board, using MFC interface to achieve a visual descr iption of the board covering problem
chessboard
- 用C++语言实现棋盘覆盖分治算法 在一个2k×2k 个方格组成的棋盘中,恰有一个方格与其它方格不同,称该方格为一特殊方格,且称该棋盘为一特殊棋盘。在棋盘覆盖问题中,要用4种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格-C++ language with the board divided coverage of a 2k × 2k Algorithm in the composition of the board of squares, just a different box
TP_ChessBoard
- 棋盘覆盖程序 自己编写的VC++程序,可以看到覆盖的过程-ChessBoard
MakeChessboard_cvScale
- 在opencv的基础上,使用vc++编译的文件,制作自己需要的棋盘格,满足一般所需!-make chessboard by yourself!
qishixunyou
- 编写程序求解骑士巡游问题:在n行n列的棋盘上(如n=5),假设一位骑士(按象棋中“马走日”的行走法)从初始坐标位置(x1,y1)出发,要遍访(巡游)棋盘中的每一个位置一次。请编一个程序,为骑士求解巡游“路线图”(或告诉骑士,从某位置出发时,无法遍访整个棋盘 — 问题无解)。 当n=5时,意味着要在5行5列的棋盘的25个“点”处,按骑士行走规则,依次将1至25这25个“棋子”(数码)分别摆放到棋盘上(摆满25个位置则成功,否则失败问题无解)。 -Knight Parade prog