Back to search

Institutional Repository of Vilnius University

Žaidimo 2048 sprendimo algoritmų tyrimas /

Abstract

dc:description

The study examines and compares four agents implemented with the A*, Minimax, and Expectimax search algorithms, all designed to solve the game 2048. The primary objective was to determine which of these agents, developed and adapted to play 2048, demonstrates the highest performance. Performance was evaluated based on the maximum tile value achieved by each agent on the game board during the final move within a fixed time limit. Additionally, other metrics such as search depth achieved and the number of nodes generated within the time constraint were analyzed. The findings indicate that the agent employing the Expectimax algorithm exhibited superior performance in playing 2048 compared to the other agents.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Čekanauskas, Arnas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Čekanauskas, Arnas,. Žaidimo 2048 sprendimo algoritmų tyrimas /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD229555151&prefLang=en_US