|
|
Chess Program with Various Chess Variations
Mydliar, Ján ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
The main task was create a program allowing human play against the computer and computer to computer with the option selected variants of chess. To start work describes algorithms for playing games and their various features. The following is a copy of selected options, evaluation function, the changes on top of the program and the graphical user interface.
|
|
|
Chess Program for Bughouse Variant
Staňa, Marek ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
This thesis describes process of creating a chess program playing Bughouse variant allowing to play against human or other programs. Firstly explains difference in Bughouse rules from classic chess, main part is about artificial intelligence. It compares individual methods used for making chess programs and adapts them to Bughouse variant.
|
|
|
Chess Program for Various Chess Variations
Jadrníček, Zbyněk ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
This thesis describes process of creating chess program allowing human play against computer. First part explains chess rules, next parts are about artificial intelligence. Thesis deals with nontraditional chess variants and also with changes, which were made in implementation in comparasion with classical game. It compares usual chessboard representations in computer, methods of playing games and techniques of evaluation chessboard state. The aim was to achieve high artificial intelligence by using of effective algorithms.
|
|
|
Various Chess Variations
Ďuriš, Michal ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The main goal of this bachelor's thesis was to create an application, which offer an opportunity to play a game between human and computer with possibillity of choosing from various chess variations. The introduction classifies existing chess variations into the groups and describes eventuelly required changes of valuation function in comparison with classic chess variation. Next part is describes a suggestion and a realization of implementation and also the main graphical user compotents. The last part evaluates the thesis with suggestions how to improve the application even more.
|
|
|
Chess Program with Various Chess Variations with New Figure
Dostál, Martin ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
This thesis deals with an analysis and evaluation of methods and algorithms needed for successfull implementation of a chess program. Both the basic principles and further currently used extensions of these methods and algorithms are stated with a goal to implement a quality chess program playing different chess variations including a new figure. This thesis also introduces the basic pillars of every chess program - these pillars include board representation, state space search, evaluation of a game state and changes required for implementation of new chess variations. A comparison of difficulties of individual methods is included for an overview.
|
|
|
The Hnefatafl Board Game Artificial Intelligence
Stratilová, Lenka ; Doležel, Michal (referee) ; Kubát, David (advisor)
The main task of this bachelor thesis is to design, create and test the Hnefatafl board game artificial intelligence. In the beginning of thesis are description of Hnefatafl rules with its variations and the most common algorithms of artificial intelligence. The following describes the implementation and testing. The game allows two players mode, player against computer mode and two computers mode.
|
|
|
Chess Program with Various Chess Variations with New Figure
Dostál, Martin ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
This thesis deals with an analysis and evaluation of methods and algorithms needed for successfull implementation of a chess program. Both the basic principles and further currently used extensions of these methods and algorithms are stated with a goal to implement a quality chess program playing different chess variations including a new figure. This thesis also introduces the basic pillars of every chess program - these pillars include board representation, state space search, evaluation of a game state and changes required for implementation of new chess variations. A comparison of difficulties of individual methods is included for an overview.
|
|
|
Chess Program for Bughouse Variant
Staňa, Marek ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
This thesis describes process of creating a chess program playing Bughouse variant allowing to play against human or other programs. Firstly explains difference in Bughouse rules from classic chess, main part is about artificial intelligence. It compares individual methods used for making chess programs and adapts them to Bughouse variant.
|
|
|
Various Chess Variations
Ďuriš, Michal ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
The main goal of this bachelor's thesis was to create an application, which offer an opportunity to play a game between human and computer with possibillity of choosing from various chess variations. The introduction classifies existing chess variations into the groups and describes eventuelly required changes of valuation function in comparison with classic chess variation. Next part is describes a suggestion and a realization of implementation and also the main graphical user compotents. The last part evaluates the thesis with suggestions how to improve the application even more.
|
|
|
Chess Program with Various Chess Variations
Mydliar, Ján ; Křena, Bohuslav (referee) ; Rozman, Jaroslav (advisor)
The main task was create a program allowing human play against the computer and computer to computer with the option selected variants of chess. To start work describes algorithms for playing games and their various features. The following is a copy of selected options, evaluation function, the changes on top of the program and the graphical user interface.
|
guest ::
