Wyniki wyszukiwania - BazTech

1

Badanie wydajności silników gier komputerowych

Buczkowski Gabriel, Olszewski Kamil

Studia i Materiały Informatyki Stosowanej

|

2023

|

T. 15, nr 1

5--10

PL

Celem pracy jest przeprowadzenie badania wydajności silników gier z wykorzystaniem wbudowanych w nie narzędzi. Testy wydajności zostaną przeprowadzone dla różnych konfiguracji sprzętowych. W celu realizacji badania powstanie uproszczona gra 3D z widokiem pierwszoosobowym. Gra zostanie zaimplementowana w różnych silnikach gier: Unity, Unreal Engine, CryEngine, Godot oraz Unigine, co pozwoli zebrać dane do analizy by sprawdzić, który z nich będzie najwydajniejszy.

EN

The purpose of this is to conduct performance testing of game engines using their built-in tools. Performance tests will be conducted for various hardware configurations. In order to implement the study, a simplified 3D game with a first-person view will be created. The game will be implemented in various game engines: Unity, Unreal Engine, CryEngine, Godot and Unigine, which will allow us to collect data for analysis to see which one will be the most efficient.

2

Porównanie możliwości środowiska Unity oraz LibGDX w kontekście tworzenia gier komputerowych

Kosidło Piotr, Kowalczyk Karol, Badurowicz Marcin

Journal of Computer Sciences Institute

|

2021

|

Vol. 21

324--329

PL

W ramach pracy nad artykułem stworzone zostały dwie gry 2D - jedna przy użyciu środowiska Unity oraz druga przy użyciu LibGDX. Szczególną uwagę w pracy poświęcono porównaniu wydajności obu gier. W tym celu przeprowadzo-no badania, które miały na celu określenie, która z gier ma lepszy wpływ na zużycie zasobów procesora oraz pamięci RAM. Poświęcono również uwagę wsparciu społeczności dla obu narzędzi oraz komfortowi programisty podczas pracy w obu wspomnianych narzędziach. Wyniki badań wydajności sugerują, że LibGDX może być lepszym wyborem do tworzenia niewielkich projektów, których priorytetem jest wydajność. Na korzyść Unity przemawia jednak wsparcie społeczności oraz komfort korzystania z tego środowiska i brak konieczności korzystania z programów zewnętrznych.

EN

As part of the work on the article, two 2D games were created – one based on the Unity environment and the other based on LibGDX. Main focus in the work was to compare the performance of both games. For this purpose, research was carried out to determine which game has a better impact on the usage of CPU and RAM resources. Attention was also paid to community support for both tools and the programmer’s comfort during the work in both of these tools. The results of the performance studies suggest that LibGDX may be a better choice for creating small projects where performance is a priority. However, the support of the community and the comfort of working with the environment and the lack of need to use external programs speak in favor of Unity.

3

Identification of Unintentional Perpetrator Attack Vectors using Simulation Game: A Case Study

Macák Martin, Bojnak Stefan, Buhnova Barbora

Annals of Computer Science and Information Systems

|

2021

|

Vol. 25

349--356

EN

In our digital era, insider attacks are among the serious underresearched areas of the cybersecurity landscape. A significant type of insider attack is facilitated by employees without malicious intent. They are called unintentional perpetrators. We proposed mitigating these threats using a simulation-game platform to detect the potential attack vectors. This paper introduces and implements a scenario that demonstrates the usability of this approach in a case study. This work also helps to understand players' behavior when they are not told upfront that they will be a target of social engineering attacks. Furthermore, we provide relevant acquired observations for future research.

4

A Practical Solution to Handling Randomness and Imperfect Information in Monte Carlo Tree Search

Świechowski Maciej, Tajmajer Tomasz

Annals of Computer Science and Information Systems

|

2021

|

Vol. 25

101--110

EN

This paper provides practical guidelines for developing strong AI agents based on the Monte Carlo Tree Search algorithm in a game with imperfect information and/or randomness. These guidelines are backed up by series of experiments carried out in the very popular game - Hearthstone. Despite the focus on Hearthstone, the paper is written with reusability and universal applications in mind. For MCTS algorithm, we introduced a few novel ideas such as complete elimination of the so-called nature moves, separation of decision and simulation states as well as a multi-layered transposition table. These have helped to create a strong Hearthstone agent.

5

Analiza wybranych metod tworzenia sztucznej inteligencji na przykładzie popularnej gry w karty

Gałka Łukasz, Dzieńkowski Mariusz

Journal of Computer Sciences Institute

|

2020

|

Vol. 16

233--240

EN

The aim of the article was to analyze selected methods of creating artificial intelligence in a popular card game. Two experiments were conducted: with a human and with a computer. The following algorithms were analyzed: random, min-max, based on a neural network, statistical and statistical with the use of “cheating” technique. The examined parameters were as follows: efficiency, execution time, number of implementation code lines, implementation time and training duration. The indicator with the greatest impact on the selection of the most optimal method was efficiency. The research has shown no difference in efficiency for the neural network-based algorithm and the statistical algorithm. In other cases, the differences in this feature were significant. The use of the “cheating” technique has increased the efficiency.

PL

Celem artykułu była analiza wybranych metod tworzenia sztucznej inteligencji w popularnej grze w karty. Zostały przeprowadzone dwa eksperymenty: z człowiekiem oraz z komputerem. Analizie poddano algorytmy: losowy, minmax, bazujący na sieci neuronowej, statystyczny oraz statystyczny z użyciem techniki „oszukiwania”. Zbadano takie parametry jak: skuteczność, czas wykonania, liczbę linii kodu implementacji, czas implementacji oraz czas trwania treningu. Wskaźnikiem mającym największy wpływ na wybór najbardziej optymalnej metody była skuteczność. Badania wykazały brak różnic w skuteczności dla algorytmu bazującego na sieci neuronowej i algorytmu statystycznego. W pozostałych przypadkach różnice tej cechy były istotne. Użycie techniki „oszukiwania” zwiększyło skuteczność.

6

StarCraft agent strategic training on a large human versus human game replay dataset

Krištofík Štefan, Malík Peter, Kasáš Matúš, Neupauer Štefan

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

391--399

EN

Real-time strategy games are currently very popular as a testbed for AI research and education. StarCraft: Brood War (SC:BW) is one of such games. Recently, a new large, unlabeled human versus human SC:BW game replay dataset called STARDATA was published. This paper aims to prove that the player strategy diversity requirement of the dataset is met, i.e., that the diversity of player strategies in STARDATA replays is of sufficient quality. To this end, we built a competitive SC:BW agent from scratch and trained its strategic decision making process on STARDATA. The results show that in the current state of the competitive environment the agent is capable of keeping a stable rating and a decent win rate over a longer period of time. It also performs better than our other, simple rule-based agent. Therefore, we conclude that the strategy diversity requirement of STARDATA is met.

7

Introducing LogDL - Log Description Language for Insights from Complex Data

Świechowski Maciej, Ślęzak Dominik

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

145--154

EN

We propose a new logic-based language called LogDL (Log Description Language) that is designed to be a medium for the knowledge discovery workflows conducted over multimodal process-related and spatio-temporal data sets. It makes it possible to operate with the original data along with machine-learning-driven insights expressed as facts, rules and formulas, regarded as higher-level descriptive logs reflecting knowledge about the observed processes in real or virtual environments. LogDL is inspired by the research at the border of AI and games, precisely by GDL (Game Description Language) that was developed for General Game Playing. We compare LogDL to GDL, emphasizing that formal frameworks for analyzing gameplay data sets are a good prerequisite for the case of real,``not digital'' processes. As LogDL is a logic-based language, we present its syntax and semantics. We also discuss how to design its high-performance interpreter that is a must for commercial scenarios.

8

Game AI Competitions: Motivation for the Imitation Game-Playing Competition

Świechowski Maciej

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

155--160

EN

Games have played crucial role in advancing research in Artificial Intelligence and tracking its progress. In this article, a new proposal for game AI competition is presented. The goal is to create computer players which can learn and mimic the behavior of particular human players given access to their game records. We motivate usefulness of such an approach in various aspects, e.g., new ways of understanding what constitutes the human-like AI or how well it fits into the existing game production workflows. This competition may integrate many problems such as learning, representation, approximation and compression of AI, pattern recognition, knowledge extraction etc. This leads to multi-directional implications both on research and industry. In addition to the proposal, we include a short survey of the available game AI competitions.

9

Fun Retrospectives in Intel Technology Poland

Mich Dominik, Ng Yen Ying

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

705--708

EN

One of the Agile principles is that the team should regularly reflect on"how to become more effective, then tunes and adjusts its behavior accordingly". While the setup of a retrospective session is intuitive, in praxis, conducting successful retrospectives is challenging. This paper is a continuation of our previous work on the use collaborative games in addressing common retrospective problems. In addition to the replication of our previous action research in a new context, we aim to investigate whether preliminary anonymous idea generation mitigates negative social influences that have been identified as causes of poor performance of brainstorming. The obtained results confirms the previous findings that game-based retrospectives produces better results than the standard retrospective as well as improves participants' creativity, involvement, and communication. Our findings also suggest benefits to the preliminary anonymous idea generation.

10

15 Years Later: A Historic Look Back at "Quake 3: Ray Traced"

Pohl Daniel, Panneer Selvakumar, Vembar Deepak S., Marshall Carl S.

Annals of Computer Science and Information Systems

|

2020

|

Vol. 21

401--412

EN

Real-time ray tracing has been a goal and a challenge in the graphics field for many decades. With recent advances in the hardware and software domains, this is becoming a reality today. In this work, we describe how we got to this point by taking a look back at one of the first fully ray traced games:``Quake 3: Ray Traced''. We provide insight into the development steps of the project with unreleased internal details and images. From a historical perspective, we look at the challenges pioneering in this area in the year 2004 and highlight the learnings in implementing the system, many of which are relevant today. We start by going from a blank screen to the full ray traced gaming experience with dynamic animations, lighting, rendered special effects and a simplistic implementation of the gameplay with basic AI enemies. We describe the challenges encountered with aliasing and the methods used to alleviate it. Lastly, we describe for the first time the unofficial continuation of the project, code named``Quake 3: Team Arena Ray Traced'', and provide an overview of the changes over the past 15 years that made it possible to generate fully ray-traced interactive gaming experiences with mass market hardware and an open software stack.

11

Potencjał świata gier

Michalak Piotr

Geodeta : magazyn geoinformacyjny

|

2019

|

nr 5

14--16

12

Visual rule editor for e-guide gamification web platform

Kulpa Artur, Swacha Jakub, Muszyńska Karolina

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

705--709

EN

Gamification is applied in different information systems to motivate the users and make their experience with the system richer and more engaging. Gamification employed in e-guides aims at enhancing the process of visiting a tourist attraction. Even though each tourist attraction is unique and requires an individual gamification scheme, similarities in the components and procedures used to develop such schemes led to the development of a generic e-guide gamification framework. One of its main principles is to store the gamification rules as a content separate from the engine to process them. This way, the rules can be easily edited by subject matter experts. This paper describes a visual rule editor developed to facilitate this process.

13

Training subset selection for support vector regression

Liu Cenru, Cen Jiahao

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

11--14

EN

As more and more data are available, training a machine learning model can be extremely intractable, especially for complex models like Support Vector Regression (SVR) train- ing of which requires solving a large quadratic programming optimization problem. Selecting a small data subset that can effectively represent the characteristic features of training data and preserve their distribution is an efficient way to solve this problem. This paper proposes a systematic approach to select the best representative data for SVR training. The distribution of both predictor and response variables are preserved in the selected subset via a 2-layer data clustering strategy. A 2-layer step-wise greedy algorithm is introduced to select best data points for constructing a reduced training set. The proposed method has been applied for predicting deck's win rates in the Clash Royale Challenge, in which 10 subsets containing hundreds of data examples were selected from 100k for training 10 SVR models to maximize their prediction performance evaluated using R-squared metric. Our final submission having a R2 score of 0.225682 won the 3rd place among over 1200 solutions submitted by 115 teams.

14

Efficient support vector regression with reduced training data

Cen Ling, Vu Quang Hieu, Ruta Dymitr

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

15--18

EN

Support Vector Regression (SVR) as a supervised machine learning algorithm have gained popularity in various fields. However, the quadratic complexity of the SVR in the number of training examples prevents it from many practical applications with large training datasets. This paper aims to explore efficient ways that maximize prediction accuracy of the SVR at the minimum number of training examples. For this purpose, a clustered greedy strategy and a Genetic Algorithm (GA) based approach are proposed for optimal subset selection. The performance of the developed methods has been illustrated in the context of Clash Royale Challenge 2019, concerned with decks' win rate prediction. The training dataset with 100,000 examples were reduced to hundreds, which were fed to SVR training to maximize model prediction performance measured in validation R2 score. Our approach achieved the second highest score among over hundred participating teams in this challenge.

15

Clash Royale Challenge: how to select training decks for win-rate prediction

Janusz Andrzej, Grad Łukasz, Grzegorowski Marek

Annals of Computer Science and Information Systems

|

2019

|

Vol. 18

3--6

EN

We summarize the sixth data mining competition organized at the Knowledge Pit platform in association with the Federated Conference on Computer Science and Information Systems series, titled Clash Royale Challenge: How to Select Training Decks for Win-rate Prediction. We outline the scope of this challenge and briefly present its results. We also discuss the problem of acquiring knowledge about new notions from video games through an active learning cycle. We explain how this task is related to the problem considered in the challenge and share results of experiments that we conducted to demonstrate usefulness of the active learning approach in practice.

16

Rozwój symulacji jako narzędzia w logistyce miejskiej za pomocą sztucznej inteligencji na przykładzie gry Cities: Skylines

Pajka A., Gera G.

Journal of TransLogistics

|

2018

|

Vol. 4, nr 1

101--108

PL

Artykuł prezentuje możliwość zastosowania sztucznej inteligencji w symulacjach jako nowego rozwiązania w celu poprawienia przepływu dóbr i osób w mieście. Pokazuje też zależność i kooperacyjność rozwoju sztucznej inteligencji z grami komputerowymi jako możliwy fundament rozwoju jej algorytmów. Omówiono także elementy gry Cities: Skylines odzwierciedlające rzeczywistość, które mogłyby pomóc w rozwoju sztucznej inteligencji. Dodatkowo omówiono temat użycia gry jako narzędzia badawczego podnoszącego świadomość problemów logistyki miejskiej wśród zwykłych uczestników ruchu codziennego w miastach zarówno tych poruszających się pieszo jak i środkami transportu publicznego bądź prywatnego.

EN

The article presents the possibility of using artificial intelligence in simulations as a new solution to improve the flow of goods and people in the city. It also shows the dependence and interaction of the development of artificial intelligence with computer games in order to develop its algorithms. The parts of the Cities: Skylines game reflecting reality these could help in the development of artificial intelligence was presented. Additionally, the topic of using game as a research instrument which improves awareness of urban logistics’ problem for common people using public or private transport was also presented.

17

Heterogeneous fog generated with the effect of light scattering and blur

Gawron M., Boryczka U.

Journal of Applied Computer Science

|

2018

|

Vol. 26, nr 2

31--43

EN

The development of computer graphics forces new requirements on the developers, which will make the virtual world more similar to the real world. One of these elements is the simulation of fog. Common fog algorithms mix the color of the scene with the color of the fog over a certain distance. However, one feature of the naturally foggy scenery is ignored. With the distance and density of the fog, the observed scenery or individual objects become more blurred. In this paper we will present our implementation of the distance fog in the Unreal Engine 4, including the effect of blurring the foggy areas, simulating of light scattering and variations in fog density using noise.

18

Affective pathfinding in video games

Daszuta M., Wróbel F., Rynkiewicz F., Szajerman D., Napieralski P.

Journal of Applied Computer Science

|

2018

|

Vol. 26, nr 2

23--29

EN

To allow player submerge in created environment of a video game, agents called Non-Player Characters (NPCs) should act believably. One of the most vital aspect, in case of NPCs is pathfinding. There are a few methods that allow change path finding algorithms to become more human-like. Yet, those are not considering many vital aspects of human decisions regarding path choosing. The main purpose of this paper is to present known approaches and show example of a new approach that wider considers psychological aspects of decision making in case of choosing a path.

19

A memory model for emotional decision-making agent in a game

Rogalski J., Szajerman D.

Journal of Applied Computer Science

|

2018

|

Vol. 26, nr 2

161--186

EN

Virtual characters are an important part of many modern computer games. This paper describes a graph-based memory system designed for artificial agents that also simulate simple emotions. The system was tested using virtual simulation environment and it showed many new and desirable AI behaviours. These behaviours include simple preferences, reactions based on bot’s opinion of a stimuli or improvement of bot’s ability to find objects to interact with.

20

Kwantowa dystrybucja klucza: stan wiedzy

Michał Maj

Zeszyty Naukowe WSEI. Seria Transport i Informatyka

|

2017

|

T. 7, nr 1

17--26

PL

Analogie między informatyką i mechaniką kwantową ujawniły się jeszcze w XX wieku, czego przykładem było wykorzystanie układów kwantowych do obróbki i przesyłania informacji. Dla tych dwóch sfer dociekań naukowych najważniejszym kierunkiem badań stał się postęp prac nad komputerem kwantowym. Powstały już teorie dotyczące bramek kwantowych, które mają być podwaliną do stworzenia pełnego komputera kwantowego. Jednak największe sukcesy fizyki w informatyce dotyczą kryptografii. Niniejsza praca przybliża ogólne założenie związane z kwantową dystrybucją klucza, a w szczególności z metodą Bennetta-Brassarda. Zawarto w niej informacje dotyczące szyfrowania wiadomości, podstaw mechaniki kwantowej oraz elementów wiedzy na temat zabezpieczeń przy użyciu fotonów.

EN

The usage of the quantum state to sending messages is one of the example of analogies between Information technology and the quantum mechanics, which are known since the 20th century. From the scientific point of view the development of the quantum computing is currently the most important research. The quantum logic gate theories, which are supposed to be the beginning to create a quantum computer, have already been developed. It is worth noting that science’s greatest successes in the information technology is connected with cryptography. The article is about basic theories on the quantum key distribution protocols, especially Bennett-Brassard method. There are information about messages encryption, the basics of the quantum mechanics and basics of photonics are included in the article.