{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:03:17Z","timestamp":1742396597811,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/fpt.2002.1188672","type":"proceedings-article","created":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T14:56:02Z","timestamp":1065020162000},"page":"117-124","source":"Crossref","is-referenced-by-count":3,"title":["An FPGA-based processor for shogi mating problems"],"prefix":"10.1109","author":[{"given":"Y.","family":"Hori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sonoyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Maruyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Logical Shogi Introduction","year":"1995","author":"ohtsuki","key":"ref10"},{"key":"ref11","first-page":"277","article-title":"SUPER SOMA – Solving Tactical Exchanges in Shogi without Tree Searching","author":"rollason","year":"2000","journal-title":"Computers and Games"},{"journal-title":"The C* Algorithm for AND\/OR Tree Search and its Application to a Tsume-Shogi Program","year":"1995","author":"seo","key":"ref12"},{"key":"ref13","first-page":"119","article-title":"Heuristic Programming in Artificial Intelligence 2","author":"schaeffer","year":"1991","journal-title":"the second computer olympaid"},{"journal-title":"Virtex-II 1 5V Field-Programmable Gate Arrays – Advance Product Specification","year":"2001","key":"ref14"},{"key":"ref4","first-page":"297","article-title":"A Shogi Processor with a Field Programmable Gate Array","author":"hori","year":"2000","journal-title":"Computers and Games"},{"key":"ref3","first-page":"315","article-title":"Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi","author":"grimbergen","year":"2000","journal-title":"Computers and Games"},{"key":"ref6","first-page":"134","article-title":"Algorithms of move generation in a Shogi program","author":"matsubara","year":"1994","journal-title":"Proc of The Game Programming Workshop Computer Shogi Association"},{"key":"ref5","first-page":"1","article-title":"Thoughts on Grandmaster-like Strategies","volume":"2","author":"iida","year":"1993","journal-title":"European Shogi Workshop Shogi Deutschland and EMBL"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2260-6"},{"key":"ref7","article-title":"Differences between Shogi and western Chess from a computational point of view","author":"matsubara","year":"1997","journal-title":"Board Games in Academia an interdisciplinary"},{"key":"ref2","first-page":"9","article-title":"A Plausible Move Generator for Shogi Using Static Evaluation","author":"grimbergen","year":"1999","journal-title":"Game Programming Workshop"},{"journal-title":"Searching for Solutions in Games and Artificial Intelligence","year":"1994","author":"allis","key":"ref1"},{"journal-title":"Logical Shogi Introduction","year":"1990","author":"nozaki","key":"ref9"}],"event":{"name":"2002 IEEE International Conference on Field-Programmable Technology (FPT)","acronym":"FPT-02","location":"Hong Kong, China"},"container-title":["2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8456\/26638\/01188672.pdf?arnumber=1188672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T22:43:26Z","timestamp":1489445006000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1188672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/fpt.2002.1188672","relation":{},"subject":[]}}