完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Wu, I-Chen | en_US |
dc.contributor.author | Lin, Hung-Hsuan | en_US |
dc.contributor.author | Lin, Ping-Hung | en_US |
dc.contributor.author | Sun, Der-Johng | en_US |
dc.contributor.author | Chan, Yi-Chih | en_US |
dc.contributor.author | Chen, Bo-Ting | en_US |
dc.date.accessioned | 2014-12-08T15:20:30Z | - |
dc.date.available | 2014-12-08T15:20:30Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.isbn | 978-3-642-17927-3 | en_US |
dc.identifier.issn | 0302-9743 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/14599 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Job-Level Proof-Number Search for Connect6 | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | COMPUTERS AND GAMES | en_US |
dc.citation.volume | 6515 | en_US |
dc.citation.spage | 11 | en_US |
dc.citation.epage | 22 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000295700000002 | - |
顯示於類別: | 會議論文 |