Browsing by Author "Lin, Ping-Hung"

Now showing 1 - 12 of 12

BIT WINS CONNECT6 TOURNAMENT
(2009-06-01)
Lin, Ping-Hung
;
Wu, I-Chen
;
Hsu, Shun-Chin
;
資訊工程學系
;
Department of Computer Science
Dependency-Based Search for Connect6
(2014-01-01)
Wu, I-Chen
;
Kang, Hao-Hua
;
Lin, Hung-Hsuan
;
Lin, Ping-Hung
;
Wei, Ting-Han
Allis proposed dependency-based search (DBS) to solve Go-Moku, a kind of five-in-a-row game. DBS is critical for threat space search (TSS) when there are many independent or nearly independent TSS areas. Similarly, DBS is also important for the game Connect6, a kind of six-in-a-row game with two pieces per move. Unfortunately, the rule that two pieces are played per move in Connect6 makes DBS extremely difficult to apply to Connect6 programs. This paper is the first attempt to apply DBS to Connect6 programs. The targeted program is NCTU6, which won Connect6 tournaments in the Computer Olympiad twice and defeated many professional players in Man-Machine Connect6 championships. The experimental results show that DBS yields a speedup factor of 4.12 on average, and up to 50 for some hard positions.
Development of Novel Lightweight Dual-Phase Al-Ti-Cr-Mn-V Medium-Entropy Alloys with High Strength and Ductility
(2020-01-01)
Liao, Yu-Chin
;
Chen, Po-Sung
;
Li, Chao-Hsiu
;
Tsai, Pei-Hua
;
Jang, Jason S. C.
A novel lightweight Al-Ti-Cr-Mn-V medium-entropy alloy (MEA) system was developed using a nonequiatiomic approach and alloys were produced through arc melting and drop casting. These alloys comprised a body-centered cubic (BCC) and face-centered cubic (FCC) dual phase with a density of approximately 4.5 g/cm(3). However, the fraction of the BCC phase and morphology of the FCC phase can be controlled by incorporating other elements. The results of compression tests indicated that these Al-Ti-Cr-Mn-V alloys exhibited a prominent compression strength (1940 MPa) and ductility (30%). Moreover, homogenized samples maintained a high compression strength of 1900 MPa and similar ductility (30%). Due to the high specific compressive strength (0.433 GPag/cm(3)) and excellent combination of strength and ductility, the cast lightweight Al-Ti-Cr-Mn-V MEAs are a promising alloy system for application in transportation and energy industries.
Drawn k-in-a-row games
(2011-08-12)
Chiang, Sheng-Hao
;
Wu, I-Chen
;
Lin, Ping-Hung
;
資訊工程學系
;
Department of Computer Science
Wu and Huang (2005) [12] and Wu et al. (2006) [13] presented a generalized family of k-in-a-row games, called Connect(m, n, k, p, q). Two players, Black and White, alternately place p stones on an m x n board in each turn. Black plays first, and places q stones initially. The player who first gets k consecutive stones of his/her own horizontally, vertically, or diagonally wins. Both tie the game when the board is filled up with neither player winning. A Connect(m, n, k, p, q) game is drawn if neither has any winning strategy. Given p, this paper derives the value k(draw)(p), such that Connect(m, n, k, p, q) games are drawn for all k >= k(draw)(p), m >= 1, n >= 1, 0 <= q <= p, as follows. (1) k(draw)(p) = 11. (2) For all p >= 3, k(draw)(p) = 3p + 3d - 1, where d is a logarithmic function of p. So, the ratio k(draw)(P)/P is approximately 3 for sufficiently large p. The first result was derived with the help of a program. To our knowledge, our k(draw)(p) values are currently the smallest for all 2 <= p <= 1000. (C) 2011 Elsevier B.V. All rights reserved.
Job-Level Proof Number Search
(2013-03-01)
Wu, I. -Chen
;
Lin, Hung-Hsuan
;
Sun, Der-Johng
;
Kao, Kuo-Yuan
;
Lin, Ping-Hung
This paper introduces an approach, called generic job-level search, to leverage the game-playing programs which are already written and encapsulated as jobs. Such an approach is well suited to a distributed computing environment, since these jobs are allowed to be run by remote processors independently. In this paper, we present and focus on a job-level proof number search (JL-PNS), a kind of generic job-level search for solving computer game search problems, and apply JL-PNS to solving automatically several Connect6 positions, including some difficult openings. This paper also proposes a method of postponed sibling generation to generate nodes smoothly, and some policies, such as virtual win, virtual loss, virtual equivalence, flagging, or hybrids of the above, to expand the nodes. Our experiment compared these policies, and the results showed that the virtual-equivalence policy, together with flagging, performed the best against other policies. In addition, the results also showed that the speedups for solving these positions are 8.58 on average on 16 cores.
Job-Level Proof-Number Search for Connect6
(2011)
Wu, I-Chen
;
Lin, Hung-Hsuan
;
Lin, Ping-Hung
;
Sun, Der-Johng
;
Chan, Yi-Chih
This paper proposes a new approach for proof number (PN) search, named job-level PN (JL-PN) search, where each search tree node is evaluated or expanded by a heavy-weight job, which takes normally over tens of seconds. Such JL-PN search is well suited for parallel processing, since these jobs are allowed to be performed by remote processors independently. This paper applies JL-PN search to solving automatically several Connect6 positions including openings on desktop grids. For some of these openings, so far no human expert had been able to find a winning strategy. Our experiments also show that the speedups for solving the test positions are roughly linear, fluctuating from sublinear to superlinear. Hence, JL-PN search appears to be a quite promising approach to solving games.
MORETHANFIVE WINS CONNECT6 TOURNAMENT
(2010-09-01)
Wu, I-Chen
;
Lin, Ping-Hung
;
Yen, Shi-Jim
;
資訊工程學系
;
Department of Computer Science
NCTU6 WINS THE MAN-MACHINE CONNECT6 CHAMPIONSHIP 2009
(2009-12-01)
Lin, Ping-Hung
;
Wu, I-Chen
;
資訊工程學系
;
Department of Computer Science
On Drawn K-In-A-Row Games
(2010)
Chiang, Sheng-Hao
;
Wu, I-Chen
;
Lin, Ping-Hung
;
資訊工程學系
;
Department of Computer Science
In 2005, Wu and Huang [9] presented a generalized family of k-in-a-row games. The current paper simplifies the family to Connect(k, p). Two players alternately place p stones on empty squares of an infinite board in each turn. The player who first obtains k consecutive stones of his\' own horizontally, vertically, diagonally wins. A Connect(k, p) game is drawn if both have no winning strategy. Given p, this paper derives the value k(draw)(p), such that Connect(k(draw)(p), p) is drawn, as follows. (1) k(draw)(2) = 11. (2) For all p >= 3, k(draw)(p) = 3p+3d+8, where d is a logarithmic function of p. So, the ratio k(draw)(p)/p is approximate to 3 for sufficiently large p. To our knowledge, our k(draw)(p) are currently the smallest for all 2 <= p <= 1000, except for p = 3.
Relevance-Zone-Oriented Proof Search for Connect6
(2010-09-01)
Wu, I-Chen
;
Lin, Ping-Hung
;
資訊工程學系
;
Department of Computer Science
Wu and Huang (Advances in Computer Games, pp. 180-194, 2006) presented a new family of k-in-a-row games, among which Connect6 (a kind of six-in-a-row) attracted much attention. For Connect6 as well as the family of k-in-a-row games, this paper proposes a new threat-based proof search method, named relevance-zone-oriented proof (RZOP) search, developed from the lambda search proposed by Thomsen (Int. Comput. Games Assoc. J., vol. 23, no. 4, pp. 203-217, 2000). The proposed RZOP search is a novel, general, and elegant method of constructing and promoting relevance zones. Using this method together with a proof number search, this paper solved effectively and successfully many new Connect6 game positions, including several Connect6 openings, especially the Mickey Mouse opening, which used to be one of the popular openings before we solved it.
THE MAN-MACHINE CONNECT6 CHAMPIONSHIP 2011
(2011-06-01)
Wu, I-Chen
;
Lin, Yi-Shan
;
Tsai, Hsin-Ti
;
Lin, Ping-Hung
;
資訊工程學系
Wing-augmentation reduces femoral head cutting out of dynamic hip screw
(2017-06-01)
Chen, Chih-Yu
;
Huang, Shu-Wei
;
Sun, Jui-Sheng
;
Lin, Shin-Yiing
;
Yu, Chih-Sheng
The dynamic hip screw (DHS) is commonly used in the treatment of femoral intertrochanteric fracture with high satisfactory results. However, post-operative failure does occur and result in poor prognosis. The most common failure is femoral head varus collapse, followed by lag screw cut-out through the femoral head. In this study, a novel-designed DHS with two supplemental horizontal blades was used to improve the fixation stability. In this study, nine convention DHS and 9 Orthopaedic Device Research Center (ODRC) DHSS were tested in this study. Each implant was fixed into cellular polyurethane rigid foam as a surrogate of osteoporotic femoral head. Under biaxial rocking motion, all constructs were loaded to failure point (12 mm axial displacement) or up to 20,000 cycles of 1.45 kN peak magnitude were achieved, whichever occurred first. The migration kinematics was continuously monitored and recorded. The final tip-to-apex distance, rotational angle and varus deformation were also recorded. The results showed that the ODRC DHS sustained significantly more loading cycles and exhibited less axial migration in comparison to the conventional DHS. The ODRC DHS showed a significantly smaller bending strain and larger torsional strain compared to the conventional DHS. The changes in tip-to-apex distance (TAD), post-study varus angle, post-study rotational angle of the ODRC DHS were all significantly less than that of the conventional DHS (p < 0.05). We concluded that the ODRC DHS augmented with two horizontal wings would increase the bone-implant interface contact surface, dissipate the load to the screw itself, which improves the migration resistance and increases the anti-rotational implant effect. In conclusion, the proposed ODRC DHS demonstrated significantly better migration resistance and anti-rotational effect in comparison to the conventional DHS construct. (C) 2017 IPEM. Published by Elsevier Ltd. All rights reserved.