About: Use of the Common LISP Programming Language for KONANE Two Players Game     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
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
  • R247/2-R247/6
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6046137306)
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
  • 505329
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
  • [E48CA2230BD1]
http://linked.open...v/mistoKonaniAkce
  • Kouty nad Desnou
http://linked.open...i/riv/mistoVydani
  • Pardubice
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
  • Univerzita Pardubice
https://schema.org/isbn
  • 80-7194-860-8
http://localhost/t...ganizacniJednotka
  • 22340
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software