• Journal of Korea Game Society
• /
• v.12 no.5
• /
• pp.5-12
• /
• 2012

The information represented by graphic is preferred more than by text to the game generation familiar to computer games in the cognitive style. The learning to solve the math problems represented by graphic is significantly effective to improve learner's problem-solving power in math education. In this paper, we proposed a method of graphic representation of mathematical sentences for effective learning of the game generation. The proposed method arranges the unit informations in the logical structure and represent the logical interrelation between the informations by symbols, line segments, or arrows using the graphic elements with good visibility for the game generation to recognize easily and to understand accurately the logical meaning. The proposed method is able to represent accurately the math sentences until the detail level that appears the tense and the voice of the sentences differently from the previous graphic representation method's ability. The proposed method could be used as learning tools and used widely to represent graphically mathematical informations for the instructional scaffolding of an educational game in oder that the game generation could learn effectively.

• East Asian mathematical journal
• /
• v.31 no.5
• /
• pp.717-725
• /
• 2015

Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is natural to ask if for any other variant of dominating set game, the balancedness of a rigid game and the balancedness of a relaxed game are equivalent. In this paper, we show that the answer for the question is negative by considering the rigid and relaxed paired-domination games, which is considered as a variant of dominating set games. We characterize the cores of both games and show that the rigid game being balanced is not equivalent to the relaxed game being balanced. In addition, we study the cores of paired-dominations games on paths and cycles.

• Journal of Korea Game Society
• /
• v.16 no.1
• /
• pp.111-118
• /
• 2016

This paper proposes the mathematical model of Fresnel effect used to illuminate and simulate a surface character model for defense game play. The term illumination is used to represent the process by which the amount of light reaching a surface character model used on game play is determined. The character surface shaders generally use a mathematical model to predict how light will reflect on triangles. The shading normally represents the methods used to determine the color and intensity of light reflected toward the viewer for each pixel representing the character surface model of the game. This model computes the reflection and transmission coefficients and compares simulated results to the Fresnel equations for the real game improvement.

• 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.

• Research in Mathematical Education
• /
• v.7 no.4
• /
• pp.235-246
• /
• 2003

To develop the content and form of the teacher education program for mathematical excellence, we reviewed several teacher education programs. CGI is an excellent model for teacher education program for mathematical excellence. We developed the 12 teacher education programs based on mathematical tasks developed for the gifted children and have applied them to teacher education. It is not so difficult to develop more programs, because we have made a lot of tasks for the gifted in mathematics for 8 years. Wooden Die for Drinking Game which is one of 12 programs is introduced in this article.

• Journal of the Korean Mathematical Society
• /
• v.36 no.4
• /
• pp.823-823
• /
• 1999

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.265-275
• /
• 2006

In this paper, we introduce a fractional domination game arising from fractional domination problems on graphs and focus on its balancedness and concavity. We first characterize the core of the fractional domination game and show that its core is always non-empty taking use of dual theory of linear programming. Furthermore we study concavity of this game.

• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.297-309
• /
• 2006

In this paper, we consider cooperative games arising from integer domination problem on graphs. We introduce two games, ${\kappa}-domination$ game and its monotonic relaxed game, and focus on their cores. We first give characterizations of the cores and the relationship between them. Furthermore, a common necessary and sufficient condition for the balancedness of both games is obtained by making use of the technique of linear programming and its duality.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.709-721
• /
• 2005

G. Gruenhage gave a characterization of paracompactness of locally compact spaces in terms of game theory ([6]). Starting from that result we give another such characterization using a selective version of that game, and study a selection principle in the class of locally compact spaces and its relationships with game theory and a Ramseyan partition relation. We also consider a selective version of paracompactness.

• Journal for History of Mathematics
• /
• v.22 no.1
• /
• pp.53-74
• /
• 2009

Black-out Game(Lightout, Merlin Game, ${\sigma}$+Game) is an interesting game on the chessboard, when you click a button with black or white color, it changes color of itself and other buttons who shares edges. With this rule, we win the game when we have a chessboard with all same color after we click some of the buttons of it. Pretty much of research has been made on founding the winnable strategy for this type of game. In this paper, we first introduce a history of mathematical modeling on this game. Then we develop an algorithm to offer a winnable blackout game of any size. Our tools also show our new algorithm works. Finally, we show how we can use this game in mathematics education.