Forsētu uzvaru meklēšana Gomoku spēlē
| dc.contributor.advisor | Smotrovs, Juris | en_US |
| dc.contributor.author | Jonass, Jevgenijs | en_US |
| dc.contributor.other | Latvijas Universitāte. Datorikas fakultāte | en_US |
| dc.date.accessioned | 2015-03-24T06:42:03Z | |
| dc.date.accessioned | 2025-07-20T11:46:52Z | |
| dc.date.available | 2015-03-24T06:42:03Z | |
| dc.date.issued | 2011 | en_US |
| dc.description.abstract | Šajā darbā aprakstīti divi algoritmi forsētu uzvaru meklēšnai Gomoku un Rendzju spēlēs. Pirmais algoritms meklē forsētu uzvaru ar trijniekiem (angl. Victory by Consecutive Threats, VCT), otrais algoritms meklē uzvaru ar četriniekiem (angl. Victory by Consecutive Fours, VCF). Aprakstīts, kā abi algoritmi var tikt adaptēti gan Gomoku, gan Rendzju spēlei. Algoritmi atbalsta gan ierobežotu Gomoku paveidu (kur 6 un vairāk rindā nav uzvara), gan neierobežotu Gomoku paveidu (kur 6 un vairāk rindā ir uzvara). | en_US |
| dc.description.abstract | This paper describes two algorithms for the search of the forced wins in the Gomoku and Renju games. The first algorithm searches for the Victory by Consecutive Threats (VCT), the second algorithm searches for the Victory by Consecutive Fours (VCF). The paper describes how both algorithms can be adapted for both Gomoku and Renju games. The algorithms support both restricted Gomoku variant (where 6 and more in a row is not a win) and non-restricted Gomoku variant (where 6 and more in a row is a win) | en_US |
| dc.identifier.other | 18873 | en_US |
| dc.identifier.uri | https://dspace.lu.lv/handle/7/15906 | |
| dc.language.iso | N/A | en_US |
| dc.publisher | Latvijas Universitāte | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Datorzinātne | en_US |
| dc.title | Forsētu uzvaru meklēšana Gomoku spēlē | en_US |
| dc.title.alternative | Forced win search in the Gomoku game | en_US |
| dc.type | info:eu-repo/semantics/bachelorThesis | en_US |