Job-level alpha-beta search

NCU Institutional Repository > 資訊電機學院 > 資訊工程學系 > 期刊論文 > Item 987654321/106945

請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/106945

題名:	Job-level alpha-beta search
作者:	張嘉惠;Chen, Jr-Chang;Wu, I-Chen;Tseng, Wen-Jie;Lin, Bo-Han;Chang, Chia-Hui
貢獻者:	資訊電機學院資訊工程學系
關鍵詞:	Algorithm design and analysis;Alpha-beta search;chinese chess;Complexity theory;Computer science;Computers;Educational institutions;game tree search;Games;job-level computing;opening book;Parallel processing
日期:	2015-03-01
上傳時間:	2026-04-23 13:50:03 (UTC+8)
出版者:	Institute of Electrical and Electronics Engineers Inc.;IEEE
摘要:	摘要： An approach called generic job-level (JL) search was proposed to solve computer game applications by dispatching jobs to remote workers for parallel processing. This paper applies JL search to alpha-beta search, and proposes a JL alpha-beta search (JL-ABS) algorithm based on a best-first search version of MTD(f). The JL-ABS algorithm is demonstrated by using it in an opening book analysis for Chinese chess. The experimental results demonstrated that JL-ABS reached a speed-up of 10.69 when using 16 workers in the JL system. 其他題名： TCIAIG 出版者： IEEE 出版日期： 2015-03 出處： IEEE transactions on computational intelligence and AI in games., 2015-03, Vol.7 (1), p.28-38 資源來源： IEEE Xplore 識別號： ISSN: 1943-068X 識別號： EISSN: 1943-0698 識別號： DOI: 10.1109/TCIAIG.2014.2316314 識別號： CODEN: TCIARR
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	14	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing