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

• Journal for History of Mathematics
• /
• v.25 no.4
• /
• pp.101-119
• /
• 2012

The removal of the Go Stones is a game that anyone can play through simple rules. It is not only an interesting game but also a mathematical game that requires comprehensive knowledge of several mathematical theories. Through analyzing the rules and theories of this game, students can get a new mathematical perspective and recognize something that they didn't realize as important before. Furthermore, this game is given to students as a mathematical problem unconsciously. This helps them get a mathematical approach to understanding the actual concept of the problem as well as the basic principle of the problem.

• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.830-835
• /
• 2006

본 연구에서는 바둑을 응용하여, 모바일에서 가능한 6면체 게임으로 구현 하였다. 기존의 바둑과 같은 룰과 비슷한 내용의 게임으로서 모바일 버튼의 단순 조작만으로 가능한 게임이다. 게임에 사용되는 6면체 바둑판과 바둑돌들은 PHOSHOP을 이용하여 3차원 모양의 객체로 생성하였다. 프로그래밍은 SKT GENX기반으로 구현하였다. 기존의 바둑판은 가로 세로 교차된19줄이 평면에 그려져 있으나, 6면체 바둑판은 한 평면에 가로 세로 5줄이 주사위 모양의 6표면에 연결되어있다. 대국 시의 모바일 화면 인터페이스는 바둑판의 6면 중 3면을 동시에 보이는 입체도와 6면을 펼친 전개도가 있다. 입체도는 모바일 버튼 조작에 의해 6면을 상하좌우 회전이 가능하도록 하였다. 입체도와 전개도는 동시에 보는 것을 기본으로 하나 사용자 선택에 의해 두 그림의 크기 위치 등이 다양하게 가능하도록 제공하고 있다. 바둑돌의 착점방식은 모바일 버튼 조작에 의해 커서의 이동으로 가능하다. 게임은 네트워크를 이용한 사람과 사람이 가능하도록 약식으로 구현하였다. 게임의 내용은 6면의 입체적 상황을 고려하면서 작전을 세워야 하므로 기존의 평면바둑에 비해 좀더 고난도의 사고와 전략을 요구하는 게임이다. 그리고 6면체 바둑게임은 모바일 스크린환경에서 기존의19줄 평면바둑이 문제시 될 수 있는 가독성과, 한 게임에 사용되는 시간에 대해서 유리한 요인으로 실용화의 가능성을 제시하고자 한다.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.117-123
• /
• 2007

This paper presents the Stone Influence, the Influence Point, and the Influence Area on computer Go. The Stone Influence is defined using the distance between stone and empty point. The Influence Point is defined using threshold value on the Stone Influence. The Influence Area is defined using lump of the Influence Points and its Core. In experiments using the Jeongseok data, the author obtained the threshold of Influence Points. The proposed method was verified by experiments where it was success fully applied to the influence in game of Go.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10b
• /
• pp.24-29
• /
• 2006

본 연구에서는 기존의 바둑게임을 모바일에 적합한 6면체 표면에서 가능한 게임으로 사용성을 고려하여 구현 하였다. 모바일 버튼의 단순 조작만으로 가능한 게임이다. 바둑이 모바일용으로 대중화 되지 못한 원인인 제한된 스크린에서 가독성의 한계와 게임 소요 시간을 짧게 개선하여 모바일에 적합하도록 하였다. 기존의 평면바둑판을 가로세로 5줄로 주사위형 6면으로 입체화 하였다. 화면 인터페이스는 바둑판의 6면 중 3면이 동시에 보이는 입체도와 6면을 펼친 전개도가 있다. 입체도는 모바일 버튼 조작에 의한 6면을 상하좌우 회전이 가능하도록 하였다. 입체도와 전개도는 동시에 보는 것을 기본으로 하나 사용자 선택에 의해 두 그림의 크기 위치 등이 다양하게 하였다. 바둑돌의 착점방식은 모바일 버튼 조작에 의해 커서의 이동으로 가능하다. 게임은 네트워크를 이용한 사람과 사람이 가능하도록 약식으로 구현하였다. 게임의 내용은 6면의 입체적 상황을 고려하면서 작전을 세워야 하므로 기존의 평면바둑에 비해 좀더 고난도의 사고와 전략을 요구하는 게임이다. 시간성, 이동성, 평면에서 입체공간으로의 발상의 전환 등, 모바일 특성을 고려하여 바둑게임을 구현하고자 한다.

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

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.49-55
• /
• 2007

This paper presents a method of score counting for computer Go that includes the consideration of stability, management of dead stones, and an algorithm for score counting. Thus, method for managing dead stones, filling all dames, and making additional moves is presented, along with a score-counting algorithm, where dames are defined as empty points that are not included in the area of a group, while additional moves are required for life when filling all the dames. In experiments using the final positions of 362 games, a mean error of 8.66, 5.96, and 4.15 was recorded for the score counting produced by the CGoban, HandTalk, and proposed methods, respectively. The proposed method was confirmed by experiments where it was success fully applied to the final positions.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.59-70
• /
• 2013

Although the history of the game of Go is more than 2,500 years, the theoretical studies of Go are still insufficient. In recent years a lot of studies using Artificial Intelligent(AI) have been conducted, but they do not provide the prominent theoretical reality. We applied Principal Component Analysis(PCA) to the professional Go openings, which are the early stage in Go, to analyze them especially focused on the Go game records of the professional 9-dan player Lee Sedol who is the world's top professional Go player. The results showed that among the 361 eigenvectors the 48 most significant eigenvectors capture most of the variance (99.9%) and the 30 most significant eigenvectors enable to possess 90.5 percent of the total variance. This result would be expected to considerably contribute to pattern recognition research of the professional Go openings in the near future.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.483-491
• /
• 2007

This paper proposes a Situation Simulation Framework for implementing computer game and describes the possibility of analyzing game with unfolding situation. In last few years game systems have been evolving from the performance of physical engine, network traffic in the on line game to the representation of rendering physical phenomena. In computer game, a situation hierarchy structure which allows the designer for simulating high-level specifications of game structure. Logically simulated environment is created by defining situations and events based on hierarchy structure of the situation. We classify events into explicit event is occurred by user and implicit event is occurred by system. Our study defines the existence of objects is the most prevalent factor applied to any event in game world. The advantages of this approach are able to allow for providing the conceptual design for simulation game and analyzing the situation in the game world. And this method allows us to decrease the complexity of system design and abstraction modeling for the simulation game. Specially, the introduction of the definition of events allows us to approach game design in a structural manner rather than by their classification. The proposed method was implemented in the "Shooting BaDuk" among games.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.2
• /
• pp.21-30
• /
• 2000

If there exists a model that calculates the proper candidate position whenever the game of Go is in progress, it can be used for setting up the prototype of the candidate generation algorithm without using case-based reasoning. In this paper, we analyze Go through combinatorial game theory and on the basis of probability matrix (PM) showing the difference of the territory of the black and the white. We design and implement a candidate generation system(CGS) to find the candidates at a situation in Go. CGS designed in this paper can compute Influence power, safety, probability value(PV), and PM and then generate candidate positions for a present scene, once a stone is played at a scene. The basic strategy generates five candidates for the Present scene, and then chooses one with the highest PV. CGS generates the candidate which emphasizes more defence tactics than attack ones. In the opening game of computer Go, we can know that CGS which has no pattern is somewhat superior to NEMESIS which has the Joseki pattern.