{"id":{"repo_id":"vilnius","oai_identifier":"oai:vu.lt:elaba:210646855"},"canonical_url":"https://search.ndltd.org/etd/vilnius/oai:vu.lt:elaba:210646855","repository":{"repo_id":"vilnius","name":"Vilnius University","base_url":"https://epublications.vu.lt/oai"},"display":{"title":"Skatinamasis mokymas stalo žaidimams spręsti /","abstract":"This thesis examines how machine learning algorithms are used to train board game agents to make decisions that are likely to lead to positive outcomes. An experimental environment is created to conduct reinforcement learning experiments with different types of game agents. The research aims to find the best learning and performance parameters based on the results. During the work, the performance of board game agents is improved, and an alternative method for agents to play is implemented — board game strategies. The randomness factor of the game is addressed, and it is determined whether it affects learning. Experiments evaluate the suitability of the Q-learning algorithm for the selected board game and provide recommendations for applying reinforcement learning in the experimental environment. The results of this work confirm the findings of other studies that the standard Q-learning algorithm is not capable of solving tasks with large or infinite state spaces.","abstract_html":"This thesis examines how machine learning algorithms are used to train board game agents to make decisions that are likely to lead to positive outcomes. An experimental environment is created to conduct reinforcement learning experiments with different types of game agents. The research aims to find the best learning and performance parameters based on the results. During the work, the performance of board game agents is improved, and an alternative method for agents to play is implemented — board game strategies. The randomness factor of the game is addressed, and it is determined whether it affects learning. Experiments evaluate the suitability of the Q-learning algorithm for the selected board game and provide recommendations for applying reinforcement learning in the experimental environment. The results of this work confirm the findings of other studies that the standard Q-learning algorithm is not capable of solving tasks with large or infinite state spaces.","abstract_has_math":false,"creators":["Razma, Karolis,"],"institution":"Institutional Repository of Vilnius University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-11-19T10:10:16Z","subjects":[],"languages":["lit"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://repository.vu.lt/VU:ELABAETD210646855&prefLang=en_US","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://repository.vu.lt/VU:ELABAETD210646855&prefLang=en_US","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":"open","embargo_until":null,"access_note":null},"source_record":{"url":"https://epublications.vu.lt/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Avu.lt%3Aelaba%3A210646855","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Razma, Karolis,"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2024"]},{"key":"dc:publisher","label":"Institution","values":["Institutional Repository of Vilnius University"]},{"key":"dc:relation","label":"Dc Relation","values":["https://epublications.vu.lt/object/elaba:210646855/210646855.pdf"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/bachelorThesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["lit"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.vu.lt/VU:ELABAETD210646855&prefLang=en_US"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis examines how machine learning algorithms are used to train board game agents to make decisions that are likely to lead to positive outcomes. An experimental environment is created to conduct reinforcement learning experiments with different types of game agents. The research aims to find the best learning and performance parameters based on the results. During the work, the performance of board game agents is improved, and an alternative method for agents to play is implemented — board game strategies. The randomness factor of the game is addressed, and it is determined whether it affects learning. Experiments evaluate the suitability of the Q-learning algorithm for the selected board game and provide recommendations for applying reinforcement learning in the experimental environment. The results of this work confirm the findings of other studies that the standard Q-learning algorithm is not capable of solving tasks with large or infinite state spaces."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Skatinamasis mokymas stalo žaidimams spręsti /","Reinforcement learning for solving board games."]}]}],"canonical_facts":{"dc:creator":["Razma, Karolis,"],"dc:date":["2024"],"dc:description":["This thesis examines how machine learning algorithms are used to train board game agents to make decisions that are likely to lead to positive outcomes. An experimental environment is created to conduct reinforcement learning experiments with different types of game agents. The research aims to find the best learning and performance parameters based on the results. During the work, the performance of board game agents is improved, and an alternative method for agents to play is implemented — board game strategies. The randomness factor of the game is addressed, and it is determined whether it affects learning. Experiments evaluate the suitability of the Q-learning algorithm for the selected board game and provide recommendations for applying reinforcement learning in the experimental environment. The results of this work confirm the findings of other studies that the standard Q-learning algorithm is not capable of solving tasks with large or infinite state spaces."],"dc:format":["application/pdf"],"dc:identifier":["https://repository.vu.lt/VU:ELABAETD210646855&prefLang=en_US"],"dc:language":["lit"],"dc:publisher":["Institutional Repository of Vilnius University"],"dc:relation":["https://epublications.vu.lt/object/elaba:210646855/210646855.pdf"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:title":["Skatinamasis mokymas stalo žaidimams spręsti /","Reinforcement learning for solving board games."],"dc:type":["info:eu-repo/semantics/bachelorThesis"]},"updated_at":"2026-11-19T10:10:16Z"}