• Journal of Korea Game Society
• /
• v.18 no.6
• /
• pp.59-68
• /
• 2018

In spite of its simple rule, Go is one of the most complex strategic board games in the field of Artificial Intelligence (AI). Monte-Carlo Tree Search (MCTS) is an algorithm with best-first tree search, and has used to implement computer Go. We try to find the most promising first move using MCTS for playing a Go game on a board of size smaller than $9{\times}9$ Go board. The experimental result reveals that MCTS prefers to place the first move at the center in case of odd-sized Go boards, and at the central in case of even-sized Go boards.

• Journal of Korea Game Society
• /
• v.17 no.3
• /
• pp.63-70
• /
• 2017

In AI research Go is regarded as the most challenging board game due to the positional evaluation difficulty and the huge branching factor. MCTS is an exciting breakthrough to overcome these problems. The idea behind AlphaGo was to estimate the winning rate of a given position and then to lead deeper search for finding the best promising move. In this paper, using non-strategic MCTS we verified the fact that most pro players regard the best first move as Tengen (Origin of heaven) in $9{\times}9$ Go is correct. We also compared the average winning rates of the most popular first moves.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.71-78
• /
• 2013

An efficient vehicle routing heuristic for different vehicle moving times for forward and backward between two points is studied in this research. Symmetric distance or moving times are assumed to move back and forth between two points in general, but it is not true in reality. Also, various moving speeds along time zones are considered such as the moving time differences between rush hours or not busy daytimes. To solve this type of extremely complicated combinatorial optimization problems, delivery zones are specified and delivery orders are determined for promising results on the first stage. Then delivery orders in each zone are determined to be connected with other zones for a tentative complete delivery route. Improvement steps are followed to get an effective delivery route for unsymmetric-time-varing vehicle moving speed problems. Performance evaluations are done to show the effectiveness of the suggested heuristic using computer programs specially designed and developed using C++.

• 한국벤처창업학회:학술대회논문집
• /
• 2008.04a
• /
• pp.33-59
• /
• 2008

Since the late 20th century, due to the globalization of markets and the rapid developments of information and communication technologies, the world has entered into the age of fierce competition. With their abundant low-cost labor, former communist countries such as China, Russia and East Europe and low-developed countries such as India and Brazil have received investments from major industrial companies. There are no other alternatives for Korea and OECD countries to move the industrial economy to the knowledge based innovation system. In knowledge based innovation system, economic development and employment of a region and nation depend solely on the number of its companies and their competitiveness. In this research, after reviewing the current state of technological innovation small companies in korea, we provide a theoretical framework to promote the level of technological innovative entrepreneurship. The framework is based on a value system model that consist of supply factors, demand factors, and supporting institutions. In order to create more innovative small businesses, we insist on the followings. First, more R&D activities related with promising new technologies should be performed. Second, more R&D funds for technological innovation small companies should be provided from governments. Third, more M&A transactions and technology transactions should be marketed freely and competitively. Fourth, more business incubating services and venture capital services should be provided. Fifth, entrepreneurship and innovation culture should be popular and institutionized among people.