• Journal of the Korea Computer Industry Society
• /
• v.3 no.3
• /
• pp.259-270
• /
• 2002

In computer Go, the method evaluating the situation of a face is not generalized. To evaluate the situations all the faces accurately, computer Go must judge owners of 361 positions according the changes of the faces. In this paper, we apply the structure of graph as a method analyzing the rules and characters of Go. The Situation Evaluation System(SES) which can evaluate the situation of a face without DB information oかy using strength of stone(SS), influence power(IP), safety(S), position value(PV), and position-value matrix(PM) is proposed. This system is very effective to evaluate the whole situations of Go because it can show the owner of 361 positions between Black and White. As a result, SES can well compute the situations in the opening game of Go. It makes 70.9% hit-ratio as compared with the practical Go games of professional players. According to the results compared with Nemesis, the commercial program which has the joseki(established stones: hewn sequences of moves near the corner which result in near-equal positions for White and Black), SES is superior to Nemesis by 10% higher in the hit-ratio of situation evaluations of professional players.

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

• The Journal of Korean Philosophical History
• /
• no.59
• /
• pp.191-214
• /
• 2018

Mozi was a practitioner who suggested the most persuasive theory about the cruelty of war among Chinese thinkers, and was a theorist who applied his theories into reality. In order to do systematic and comprehensive analysis of Mozi's book,'Non-aggression'in which he suggested anti-war and peace theory, we tried to review his theory both theoretical and practical aspects. We examined the theoretical aspects in three different parts. First, the moral basis of Mozi's anti-war peace theory is "Mutual love" in which they love each other and share their mutual benefits. Second, according to Mozi it is clear that those who caused the war as well as those who steal other people's goods should be punish based on the retribution point of view. Third, Mozi demonstrates that war is not profitable from the economic aspects as well. These three aspects are at the core of anti-war peace theory of Mozi. Next, we looked at the case of Mozi's effort to protect the weak countries in reality. His theory of 'Anti-war and Peace' is presented to protect the weaker countries. Finally, we have looked at some of the Mozi's defensive tactics, which is called the best of all in ancient. Through these considerations, it can be guessed how much he tried to narrow the gap between theory and practice. The Mozi's theory of Anti-war and Peace, which has been struggle to establish a peace in reality, still has realistic significance today.