• Title/Summary/Keyword: GameSolving

Search Result 166, Processing Time 0.025 seconds

Didactical Applications of the Baduk Pieces Game (바둑돌 게임의 교수학적 활용)

  • Kim, Boo-Yoon;Lee, Ji-Sung
    • Journal for History of Mathematics
    • /
    • v.20 no.3
    • /
    • pp.43-58
    • /
    • 2007
  • We review the eastern frog jump game and the western solitaire to apply the Baduk Pieces Game to mathematical education. This study introduce a didactical method of Baduk Pieces Game which is constructed with simplification, generalization, and extension. This didactical applications of the Baduk Pieces Game gives the students opportunities of patterns, generalization, and problem solving strategies.

  • PDF

Research of Character Design in Side-scrolling Horror Puzzle Games

  • Yi, Qi;Chung, Jeanhun
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.77-82
    • /
    • 2022
  • The third-person side view game perspective of side-scrolling games makes playing such games a completely different gaming experience from other traditional games. Nowadays, many game elements are combined with each other, and horror and puzzle elements are often combined to appear in side-scrolling games, bringing players a unique gaming experience. In such games, players seem to be watching their own manipulation of characters. The performance is the same as a stage play, so how to let players better experience such a horror and puzzle-solving stage play through the design of the characters is a key point. However, it is often difficult to accurately classify only from game elements, so first of all, the author will explain the game division of the side scrolling horror puzzle game. After that, this article will analyze the character designs in the three works with high sales and good reputation on Steam, and then draw conclusions.

Candidate First Moves for Solving Life-and-Death Problems in the Game of Go, using Kohonen Neural Network (코호넨 신경망을 이용 바둑 사활문제를 풀기 위한 후보 첫 수들)

  • Lee, Byung-Doo;Keum, Young-Wook
    • Journal of Korea Game Society
    • /
    • v.9 no.1
    • /
    • pp.105-114
    • /
    • 2009
  • In the game of Go, the life-and-death problem is a fundamental problem to be definitely overcome when implementing a computer Go program. To solve local Go problems such as life-and-death problems, an important consideration is how to tackle the game tree's huge branching factor and its depth. The basic idea of the experiment conducted in this article is that we modelled the human behavior to get the recognized first moves to kill the surrounded group. In the game of Go, similar life-and-death problems(patterns) often have similar solutions. To categorize similar patterns, we implemented Kohonen Neural Network(KNN) based clustering and found that the experimental result is promising and thus can compete with a pattern matching method, that uses supervised learning with a neural network, for solving life-and-death problems.

  • PDF

Game Model Based Co-evolutionary Solution for Multiobjective Optimization Problems

  • Sim, Kwee-Bo;Kim, Ji-Yoon;Lee, Dong-Wook
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.2
    • /
    • pp.247-255
    • /
    • 2004
  • The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

The Education Program Model for the Thinking Extension Ability of the Gifted in Information Based on Game Tree (게임 트리에 기반한 정보영재의 사고력 신장을 위한 교육 프로그램 모형)

  • Jung, Deok-Gil;Kim, Byung-Joe
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1228-1234
    • /
    • 2007
  • In this paper, we develop the thinking extension education program for the gifted students of information and prove the validity and effectiveness of the proposed model by presenting the Tic-tac-toe problem as the practical example of the information-gifted students. This model consists of four phases which has the game tree as data structure and the search of game lee as control structure. And the search of game tree becomes the basis of the thinking extension education program. This model gives the help for students to learn representing the problem as tree structure and solving the problem of tree structure using the search method of game tree. The internal ability of the information-gifted for thinking extension of this education program contains the fluency, perceptiveness, originality, power of concentration, imaginative power, analyzing skills, pattern recognition, space sense, synthesizing, problem-solving.

A study of game player's satisfaction in mobile game base (모바일게임기반에서의 게임머 고객만족에 관한 연구)

  • Park, Young-Kyun;Suh, Jung-Seok
    • Journal of Korea Game Society
    • /
    • v.1 no.1
    • /
    • pp.102-111
    • /
    • 2001
  • The purpose of this study is to empirically test developed on the basis of the literature review regarding customer satisfaction management and gamer's satisfaction factor To analyze the date collected from 1999 respondents. Frequency Corsstabs Oneway ANOVA analysis was performed with SPSS/PC+ Window 7.5. The results can be sumarized as follows. First, Dissatisfaction factor of game service is game possible area, game being cut off and game use charge. Second, Solution suvject is 'no service' in underground area/big size crowed area and game being cut of. Finally, The most impotant aspects when a customer visits Korea Movement Technology are the friendly attitude of the employee, problem-solving and papid pesponse to inquirce.

  • PDF

Applying the Nash Equilibrium to Constructing Covert Channel in IoT

  • Ho, Jun-Won
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.243-248
    • /
    • 2021
  • Although many different types of covert channels have been suggested in the literature, there are little work in directly applying game theory to building up covert channel. This is because researchers have mainly focused on tailoring game theory for covert channel analysis, identification, and covert channel problem solving. Unlike typical adaptation of game theory to covert channel, we show that game theory can be utilized to establish a new type of covert channel in IoT devices. More specifically, we propose a covert channel that can be constructed by utilizing the Nash Equilibrium with sensor data collected from IoT devices. For covert channel construction, we set random seed to the value of sensor data and make payoff from random number created by running pseudo random number generator with the configured random seed. We generate I × J (I ≥ 2, J ≥ 2) matrix game with these generated payoffs and attempt to obtain the Nash Equilibrium. Covert channel construction method is distinctly determined in accordance with whether or not to acquire the Nash Equilibrium.

Effect of Barista Job Training Game on Occupational Self Efficacy of Persons with Intellectual Disability (기능성 게임을 이용한 바리스타 직무훈련이 지적장애인의 직무효능감에 미치는 영향)

  • Kwon, Jungmin
    • Journal of Korea Game Society
    • /
    • v.17 no.1
    • /
    • pp.63-70
    • /
    • 2017
  • Occupational self-efficacy is one of the factors necessary for successful occupational rehabilitation of persons with intellectual disabilities. In this research, we investigated to see whether participating in a game-based training for job affects occupational self-efficacy. We compared a group who played a job-training game during traditional training with a group who participated only in traditional training. The results indicate that overall occupational self-efficacy of the game-based training group was affected significantly compared to the control group. Among the four subcategories, problem solving self efficacy and stress management self-efficacy showed significant improvement.

Solving Mixed Strategy Equilibria of Multi-Player Games with a Transmission Congestion (다자게임 전력시장에서 송전선 혼잡시의 복합전략 내쉬균형 계산)

  • Lee, Kwang-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.11
    • /
    • pp.492-497
    • /
    • 2006
  • Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.

The Education Program Model for the Thinking Extension Ability of the Gifted in Information Based on Game Tree (게임 트리에 기반한 정보영재의 사고력 신장을 위한 교육 프로그램 모형)

  • Jung, Deok-Gil;Kim, Byung-Joe
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.310-314
    • /
    • 2007
  • In this paper, we develop the thinking extension education program for the gifted students of information, and prove the validity and effectiveness of the proposed model by presenting the Tic-tac-toe problem as the practical example of the information-gifted students. This model consists of four phases which has the game tree as data structure and the search of game tree as control structure. And the search of game tree becomes the basis of the thinking extension education program. This model gives the help for students to learn representing the problem as tree structure and solving the problem of tree structure using the search method of game tree. The internal ability of the information-gifted for thinking extension of this education program contains the fluency, perceptiveness, originality, power of concentration, imaginative power, analyzing skills, pattern recognition, space sense, synthesizing, problem-solving.

  • PDF