• Journal of Korea Game Society
• /
• v.18 no.4
• /
• pp.99-106
• /
• 2018

Board games have many game characters and many state spaces. Therefore, games must be long learning. This paper used reinforcement learning algorithm. But, there is weakness with reinforcement learning. At the beginning of learning, reinforcement learning has the drawback of slow learning speed. Therefore, we tried to improve the learning speed by using the heuristic using the knowledge of the problem domain considering the game tree when there is the same best value during learning. In order to compare the existing character the improved one. I produced a board game. So I compete with one-sided attacking character. Improved character attacked the opponent's one considering the game tree. As a result of experiment, improved character's capability was improved on learning speed.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.339-347
• /
• 2008

A balanced game is one where the main determining factor for the success of the player is the skill level of that player Random events can occur, but a better player should be more successful than a poor one unless the player has an unusually long run of bad luck. Balancing a game is a very difficult to define a purpose, and to implement process. The possible ways are somewhat subjective and depend on the nature of the game. This paper provides new algorithm for character adjustment using log function with some nature-based Ideas. The algorithm shows not only how we decide the exact point of character adjustment but also how much we have to modify the parameters for changing abilities of the character. This paper shows the experimental results of the algorithm and shows differences between normal game playing and playing with character adjustment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1181-1187
• /
• 2010

This paper proposes a mobile AI (Artificial Intelligence) conducting decision-making in the game through education for intelligent character on the basis of Neural Network. Neural Network is learned through the input/output value of the algorithm which defines the game rule and the problem solving method. The learned character is able to perceive the circumstances and make proper action. In this paper, the mobile AI using Neural Network has been step-by-step designed, and a simple game has been materialized for its functional experiment. In this game, the goal, the character, and obstacles exist on regular 2D space, and the character, evading obstacles, has to move where the goal is. The mobile AI can achieve its goals in changing environment by learning the solution to several problems through the algorithm defined in each experiment. The defined algorithm and Neural Network are designed to make the input/output system the same. As the experimental results, the suggested mobile AI showed that it could perceive the circumstances to conduct action and to complete its mission. If mobile AI learns the defined algorithm even in the game of complex structure, its Neural Network will be able to show proper results even in the changing environment.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.143-155
• /
• 2006

In this paper, we suggest a network game system that can support video game based on multi-platform for multi-user video game, Latency occurring from the load fluctuation in realtime network game is overcomed by using an initial delay buffering scheme on client, when a real-fire game is played, and shows that stable play for a game is achieved as the result of the scheme. Also, We suggest a retransmission algorithm based on the history of game commands, and this Algorithm supplement shortcomings for packet loss and pocket error on UDP communication.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.13-20
• /
• 2016

The purpose of this study is to investigate and suggest nonviolent, emotionally and helpful games for young people. In this paper, the digital animation, advantages, disadvantages, production process, etc. for overseas trends were defined. Also, creating games with the Visual Basic language in the animated feature of the disadvantages of existing algorithms shows case and screen time, so delayed distortion appears respectively. The proposed algorithm improves the speed and distortion through the screen. Simply two games of in-game animation and animation in complex game features were designed for the experiment and showed the superiority of the proposed algorithm by running. In this paper, the user interface of the game for children and proposed relevant algorithms were designed and resultant screens of the game showed. Most of contemporary games are violent to children. Therefore, in order to solve such problems, the game which is not violent but educative and child-friendly was designed and implemented in this paper. The future study on the game with a more in-depth is needed for animation techniques.

• Journal of Korea Game Society
• /
• v.3 no.2
• /
• pp.24-29
• /
• 2003

The market of digital avatar with internet and digital technology is increasing rapidly. The users want to express any free-formed motion of their avatars in the cyber space. The user s motion capturing method as the avatar's motion can express any free-formed motion of the avatar in real-time but the methods are expensive and inconvenient. In this paper, we proposed a new method of expressing any free-formed motion of the avatar in real-time. The proposed method is an algorithm for real-time control of a 3D avatar in symmetry-formed free motion. Specially, the algorithm aims at the motion control of a 3D avatar for online dancing games. The proposed algorithm uses the skeleton character model and controls any one of two hands of the character model by a joystick with two sticks. In the symmetry-formed motion, the position and orientation of one hand can determine the position and orientation of the other hand. And the position and orientation of a hand as an end-effector can determine the pose of the arm by Inverse Kinematics. So the algorithm can control the symmetry-formed free motions of two arms by one joystick with two sticks. In the dance game, the algorithm controls the arm motion by the joystick and the other motion by the motion captured DB.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.4043-4060
• /
• 2017

Network Intrusion Detection (NID), an important topic in the field of information security, can be viewed as a pattern recognition problem. The existing pattern recognition methods can achieve a good performance when the number of training samples is large enough. However, modern network attacks are diverse and constantly updated, and the training samples have much smaller size. Furthermore, to improve the learning ability of SVM, the research of kernel functions mainly focus on the selection, construction and improvement of kernel functions. Nonetheless, in practice, there are no theories to solve the problem of the construction of kernel functions perfectly. In this paper, we effectively integrate the advantages of the radial basis function kernel and the polynomial kernel on the notion of the game theory and propose a novel kernel SVM algorithm with game theory for NID, called GTNID-SVM. The basic idea is to exploit the game theory in NID to get a SVM classifier with better learning ability and generalization performance. To the best of our knowledge, GTNID-SVM is the first algorithm that studies ensemble kernel function with game theory in NID. We conduct empirical studies on the DARPA dataset, and the results demonstrate that the proposed approach is feasible and more effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2454-2467
• /
• 2015

Increasing traffic and bandwidth requirements bring challenges to the next generation wireless networks (5G). As one of the main technology in 5G networks, Ultra-Dense Network (UDN) can be used to improve network coverage. In this paper, a radio over fiber based model is proposed to solve the load balancing problem in ultra-dense network. Stochastic differential game is introduced for the load balancing algorithm, and optimal load allocated to each access point (RAP) are formulated as Nash Equilibrium. It is proved that the optimal load can be achieved and the stochastic differential game based scheme is applicable and acceptable. Numerical results are given to prove the effectiveness of the optimal algorithm.

• Communications of Mathematical Education
• /
• v.21 no.4
• /
• pp.597-612
• /
• 2007

For finding the optimal strategy in Blackout game which was introduced in the homepage of popular movie "Beautiful mind", we have developed and generalized a mathematical proof and an algorithm with a couple of softwares. It did require only the concept of basis and knowledge of basic linear algebra. Mathematical modeling and analysis were given for the square matrix case in(Lee,2004) and we now generalize it to a generalized $m{\times}n$ Blackout game. New proof and algorithm will be given with a visualization.