完整後設資料紀錄
DC 欄位語言
dc.contributor.authorWu, I-Chenen_US
dc.contributor.authorLin, Hung-Hsuanen_US
dc.contributor.authorLin, Ping-Hungen_US
dc.contributor.authorSun, Der-Johngen_US
dc.contributor.authorChan, Yi-Chihen_US
dc.contributor.authorChen, Bo-Tingen_US
dc.date.accessioned2014-12-08T15:20:30Z-
dc.date.available2014-12-08T15:20:30Z-
dc.date.issued2011en_US
dc.identifier.isbn978-3-642-17927-3en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/11536/14599-
dc.description.abstractThis 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.isoen_USen_US
dc.titleJob-Level Proof-Number Search for Connect6en_US
dc.typeProceedings Paperen_US
dc.identifier.journalCOMPUTERS AND GAMESen_US
dc.citation.volume6515en_US
dc.citation.spage11en_US
dc.citation.epage22en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000295700000002-
顯示於類別:會議論文