Attributes | Values |
---|
rdf:type
| |
Description
| - The KONANE board game or Hawaiian chess is a typical example of the game of two opponents without the influence of random variables. This paper presents a proposal of representation and playing strategy of this game. It is used a MINIMAX simple algorithm for expanded tree search. There are proposed two simple heuristic functions for evaluation the quality of current distribution of the men on the board. For implementation of algorithms, data structures, agents etc. the Common LISP programming language was chosen and all the code was tested in the interpreter CLISP. It can be carried out a play between two agents that can be chosen as a man, an agent choosing random moves or agents using for move selection the MINIMAX strategy and a heuristic.
- The KONANE board game or Hawaiian chess is a typical example of the game of two opponents without the influence of random variables. This paper presents a proposal of representation and playing strategy of this game. It is used a MINIMAX simple algorithm for expanded tree search. There are proposed two simple heuristic functions for evaluation the quality of current distribution of the men on the board. For implementation of algorithms, data structures, agents etc. the Common LISP programming language was chosen and all the code was tested in the interpreter CLISP. It can be carried out a play between two agents that can be chosen as a man, an agent choosing random moves or agents using for move selection the MINIMAX strategy and a heuristic. (en)
- KONANE neboli Havajské šachy je typickým příkladem hry dvou hráčů bez vlivu náhody. Tato práce obsahuje návrh reprezentace a řešení této hry. Je využit jednoduchý algoritmus MINIMAX v iterativní verzi pro prohledávání expandovaného stromu (možných variant průběhu hry). Pro posuzování kvality jednotlivých stavů (aktuální distribuce kamenů na šachovnici) byly navrženy dvě jednoduché heuristiky. Pro implementaci algoritmu, datových struktur, agentů atd. byl využit funkcionální programovací jazyk CLISP. Je možno realizovat hru mezi dvojicí agentů, které můžeme volit jako člověka, jako agenta vybírajícího náhodné tahy nebo jako agenty používající pro výběr tahu algoritmus MINIMAX a jednu z heuristik. (cs)
|
Title
| - Use of the Common LISP Programming Language for KONANE Two Players Game
- Use of the Common LISP Programming Language for KONANE Two Players Game (en)
- Využití jazyka Common LISP pro KONANE - hru dvou hráčů (cs)
|
skos:prefLabel
| - Use of the Common LISP Programming Language for KONANE Two Players Game
- Use of the Common LISP Programming Language for KONANE Two Players Game (en)
- Využití jazyka Common LISP pro KONANE - hru dvou hráčů (cs)
|
skos:notation
| - RIV/60461373:22340/06:00016795!RIV07-MSM-22340___
|
http://linked.open.../vavai/riv/strany
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/60461373:22340/06:00016795
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - two players games; heuristic search; Common LISP programming language (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Proceedings of 7th International Conference Process Control ŘÍP 2006
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Hanta, Vladimír
- Vrzák, Jan
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
http://linked.open...n/vavai/riv/zamer
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |