|
|
Game Playing with Uncertainty
Bajza, Jakub ; Zbořil, František (referee) ; Zbořil, František (advisor)
This Bachelor thesis describes the implementation of expectiminimax algorithm for zero-sum games. It also introduces the complications, that you can face, if working on applying the expectiminimax algorithm to more complicated games of this category. This thesis also presents a way to create an evaluation function for computer opponent. The applicability of these evaluation functions is demonstrated by series of tests, where human player plays against computer opponent or two computer opponents play against each other.
|
|
|
Building kD Tree on GPU
Bajza, Jakub ; Kula, Michal (referee) ; Kobrtek, Jozef (advisor)
This term project addresses the construction of kD tree acceleration structures and parallelization of this construction using GPU. At the beginning, there is an introduction of the reader into CUDA platform for parallel programming. There is a decription of generic principles as well as specific features that will be used in this thesis. Following that the reader is put into the issue of acceleration structures for Ray tracing. These structures are described and the kD tree acceleration structure and its variants are portrayed in detail. After that the analysis of chosen kD tree variant is broken down and the problems and issuse of its parallel implementation are adressed. As a part of implementation discription, there is a short descripton of CPU variant and detailed specifications of the CUDA kernels. The testing section brings the results of implementation in form of CPU vs GPU comparison, as well as evaluation of how much the metric set in design was fulfilled. In the end there is a summary of achieved goals and results followed by possible future improvements for the implementation.
|
|
|
Building kD Tree on GPU
Bajza, Jakub ; Kula, Michal (referee) ; Kobrtek, Jozef (advisor)
This term project addresses the construction of kD tree acceleration structures and parallelization of this construction using GPU. At the beginning, there is an introduction of the reader into CUDA platform for parallel programming. There is a decription of generic principles as well as specific features that will be used in this thesis. Following that the reader is put into the issue of acceleration structures for Ray tracing. These structures are described and the kD tree acceleration structure and its variants are portrayed in detail. After that the analysis of chosen kD tree variant is broken down and the problems and issuse of its parallel implementation are adressed. As a part of implementation discription, there is a short descripton of CPU variant and detailed specifications of the CUDA kernels. The testing section brings the results of implementation in form of CPU vs GPU comparison, as well as evaluation of how much the metric set in design was fulfilled. In the end there is a summary of achieved goals and results followed by possible future improvements for the implementation.
|
|
|
Game Playing with Uncertainty
Bajza, Jakub ; Zbořil, František (referee) ; Zbořil, František (advisor)
This Bachelor thesis describes the implementation of expectiminimax algorithm for zero-sum games. It also introduces the complications, that you can face, if working on applying the expectiminimax algorithm to more complicated games of this category. This thesis also presents a way to create an evaluation function for computer opponent. The applicability of these evaluation functions is demonstrated by series of tests, where human player plays against computer opponent or two computer opponents play against each other.
|
guest ::
RSS feed.