Search - max - CodeBus

Search - max - List

[Chess Poker games] chess DL : 0: 高智商五子棋，只编写了人机对弈部分，运用了博弈树进行搜索，在选取最优的走步时使用极大极小分析法-High IQ Gobang only part of the preparation of the human-computer game, using a game tree search, select the best walking in the use of max-min analysis
Date : 2025-12-28 Size : 240kb User : 吴李涛
[Chess Poker games] GameGoBang DL : 0: 关于一个五子棋的算法描述，使用MAX-MIN算法-Gobang algorithm on a description of the use of MAX-MIN algorithm
Date : 2025-12-28 Size : 41kb User : dong
[Chess Poker games] rjxq-mygame DL : 0: 人机下棋游戏，用C++语言实现，其中包含一个.h和一个.cpp文件.int n=0,max=0,temp=0 char ch //输出棋盘原始状态 Print() cout<<"You First or Second(F/S)?" cin>>ch if((ch== S )||(ch== s )) { status[4]= X counter=counter+1 Print() cout<<"Computer plays 5!"<<endl }-it is include two files,one is .h file,another one is .cpp file. int n=0,max=0,temp=0 char ch //输出棋盘原始状态 Print() cout<<"You First or Second(F/S)?" cin>>ch if((ch== S )||(ch== s )) { status[4]= X counter=counter+1 Print() cout<<"Computer plays 5!"<<endl }
Date : 2025-12-28 Size : 119kb User : 园子
[Chess Poker games] EightQueen_bcb6 DL : 0: (This is Borland C++Builder version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-28 Size : 287kb User : yout
[Chess Poker games] EightQueen_java DL : 0: (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-28 Size : 118kb User : yout
[Chess Poker games] EightQueen_vb DL : 0: (This is Visual Basic 6 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-28 Size : 31kb User : yout
[Chess Poker games] EightQueen_vs2008 DL : 0: (This is VS2008 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-28 Size : 164kb User : yout
[Chess Poker games] Omok DL : 0: 五子棋游戏利用C++語言min max alpha beta cutoff algorithm-Omok (five chess) game using C++ min max algorithn and alpha beta cutoff algorithm
Date : 2025-12-28 Size : 198kb User : jieun