Minimax ja alfa-beta-karsinta

Vuoropohjaisia pelejä pelaavien ohjelmien pitää pystyä suunnittelemaan siirtonsa. Tutkielmassa perehdytään minmax-alrogitmin ja alfa-beta-karsinnan toimintaan, perehtymällä niistä tuotettuun kirjallisuuteen. Tutkielmassa on tarkoitus selvittää, ovatko minimax- ja alfa-beta-algoritmit tehokkaita vuor...

Full description

Bibliographic Details
Main Author: Karhunen, Jaakko
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2018
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/58204
_version_ 1826225798753812481
author Karhunen, Jaakko
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Karhunen, Jaakko Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Karhunen, Jaakko Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Karhunen, Jaakko
datasource_str_mv jyx
description Vuoropohjaisia pelejä pelaavien ohjelmien pitää pystyä suunnittelemaan siirtonsa. Tutkielmassa perehdytään minmax-alrogitmin ja alfa-beta-karsinnan toimintaan, perehtymällä niistä tuotettuun kirjallisuuteen. Tutkielmassa on tarkoitus selvittää, ovatko minimax- ja alfa-beta-algoritmit tehokkaita vuoropohjaisten pelien tekoälyn päätöksenteossa. Niiden toimintaan ja rakenteeseen perehdytään shakkia esimerkkinä käyttäen. Algoritmit ovat toimivia tarkoituksessaan, ja niiden avulla tekoäly pystyy suunnittelemaan siirtonsa hyvin. Programs playing turn-based games need to be able to plan their moves. This study will examine minimax- and alpha-beta-algorithms by reading up on the literature written about them. The study's purpose is to investigate, are minimax and alpha-beta-algorithms efficient in the decision making of turn-based games artificial intelligence. Their functions and structure is examined by using chess as an example. The algorithms are functional for this purpose, and with their help the ai can plan its moves well.
first_indexed 2019-08-19T08:21:35Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "Lakanen, Antti-Jussi", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Karhunen, Jaakko", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2018-05-29T09:08:33Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2018-05-29T09:08:33Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2018", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/58204", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Vuoropohjaisia pelej\u00e4 pelaavien ohjelmien pit\u00e4\u00e4 pysty\u00e4 suunnittelemaan siirtonsa. Tutkielmassa perehdyt\u00e4\u00e4n minmax-alrogitmin ja alfa-beta-karsinnan toimintaan, perehtym\u00e4ll\u00e4 niist\u00e4 tuotettuun kirjallisuuteen. Tutkielmassa on tarkoitus selvitt\u00e4\u00e4, ovatko minimax- ja alfa-beta-algoritmit tehokkaita vuoropohjaisten pelien teko\u00e4lyn p\u00e4\u00e4t\u00f6ksenteossa. Niiden toimintaan ja rakenteeseen perehdyt\u00e4\u00e4n shakkia esimerkkin\u00e4 k\u00e4ytt\u00e4en. Algoritmit ovat toimivia tarkoituksessaan, ja niiden avulla teko\u00e4ly pystyy suunnittelemaan siirtonsa hyvin.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Programs playing turn-based games need to be able to plan their moves. This study will examine minimax- and alpha-beta-algorithms by reading up on the literature written about them. The study's purpose is to investigate, are minimax and alpha-beta-algorithms efficient in the decision making of turn-based games artificial intelligence. Their functions and structure is examined by using chess as an example. The algorithms are functional for this purpose, and with their help the ai can plan its moves well.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Miia Hakanen (mihakane@jyu.fi) on 2018-05-29T09:08:33Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2018-05-29T09:08:33Z (GMT). No. of bitstreams: 0\n Previous issue date: 2018", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "20", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "minimax", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "alfa-beta", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Minimax ja alfa-beta-karsinta", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-201805292875", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "teko\u00e4ly", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_58204
language fin
last_indexed 2025-02-18T10:55:39Z
main_date 2018-01-01T00:00:00Z
main_date_str 2018
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/991dbfe7-5ba5-4c0e-9c8d-5ad4fc2022e7\/download","text":"URN:NBN:fi:jyu-201805292875.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2018
record_format qdc
source_str_mv jyx
spellingShingle Karhunen, Jaakko Minimax ja alfa-beta-karsinta minimax alfa-beta Tietotekniikka Mathematical Information Technology 602 algoritmit tekoäly
title Minimax ja alfa-beta-karsinta
title_full Minimax ja alfa-beta-karsinta
title_fullStr Minimax ja alfa-beta-karsinta Minimax ja alfa-beta-karsinta
title_full_unstemmed Minimax ja alfa-beta-karsinta Minimax ja alfa-beta-karsinta
title_short Minimax ja alfa-beta-karsinta
title_sort minimax ja alfa beta karsinta
title_txtP Minimax ja alfa-beta-karsinta
topic minimax alfa-beta Tietotekniikka Mathematical Information Technology 602 algoritmit tekoäly
topic_facet 602 Mathematical Information Technology Tietotekniikka alfa-beta algoritmit minimax tekoäly
url https://jyx.jyu.fi/handle/123456789/58204 http://www.urn.fi/URN:NBN:fi:jyu-201805292875
work_keys_str_mv AT karhunenjaakko minimaxjaalfabetakarsinta