Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing

Ariyurek, Sinan
Betin Can, Aysu
Sürer, Elif


Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing
Arıyürek, Sinan; Betin Can, Aysu; Sürer, Elif (2020-03-01)
In this paper, we study the effects of several Monte Carlo Tree Search (MCTS) modifications for video game testing. Although MCTS modifications are highly studied in game playing, their impacts on finding bugs are blank. We focused on bug finding in our previous study where we introduced synthetic and human-like test goals and we used these test goals in Sarsa and MCTS agents to find bugs. In this study, we extend the MCTS agent with several modifications for game testing purposes. Furthermore, we present a...
Improving the scalability of ILP-based multi-relational concept discovery system through parallelization
Mutlu, Ayşe Ceyda; Karagöz, Pınar; Kavurucu, Yusuf (2012-03-01)
Due to the increase in the amount of relational data that is being collected and the limitations of propositional problem definition in relational domains, multi-relational data mining has arisen to be able to extract patterns from relational data. In order to cope with intractably large search space and still to be able to generate high-quality patterns. ILP-based multi-relational data mining and concept discovery systems employ several search strategies and pattern limitations. Another direction to cope w...
Enhancing the Resolution of Multimode Fiber Based Spectrometers
Kahraman, Sıddık Süleyman; Yüce, Emre; Department of Physics (2021-9)
Speckle-based spectrometers are shown to reach resolving powers that exceed the state-of-the-art grating spectrometers. These spectrometers offer high-resolution by relying on a complex spectral to spatial mapping. Multimode fibers (MMFs) reduce losses that occur from scattering of light and can also provide spectral to spatial mapping. The resolution of a MMF based spectrometer can be increased using longer fibers that in return makes them susceptible to environmental changes. This study introduces techni...
Improving the efficiency of graph-based concept discovery systems
Abay, Nazmiye Ceren; Karagöz, Pınar; Department of Computer Engineering (2014)
Concept discovery is a process for finding hidden relations from the given set of experiences named as background knowledge [27]. Concept discovery problems are investigated under Inductive Logic Programming (ILP)-based approaches and graph-based approaches [28]. Although ILP-based systems dominate the area, these systems have some problems such as local maxima and local plateaus [15]. Recently, graph based system becomes more popular due to its flexible structure, clear representation of data and ability o...
Improving the efficiency of distributed information retrieval using hybrid index partitioning
Hafızoğlu, Fatih; Altıngövde, İsmail Sengör; Department of Computer Engineering (2018)
Selective search with traditional partitioning have advantages over exhaustive search in terms of total query cost. However, it can suffer from query latency and load imbalance for most of the time due to its nature. To overcome these issues, we proposed a new partitioning method in this thesis, namely Hybrid partitioning. Our studies shows that it is possible to obtain significant savings in query latency with this new partitioning methodology. In addition to that, query processing with Hybrid partitioning...
Citation Formats
S. Ariyurek, A. Betin Can, and E. Sürer, “Enhancing the Monte Carlo Tree Search Algorithm for Video Game Testing,” 2020, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/77850.