Implementing propositional networks on FPGA

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The speed of game rules processing plays an essential role in the performance of a General Game Playing (GGP) agent. Propositional Networks (propnets) are an example of a highly efficient representation of game rules. So far, in GGP, only software implementations of propnets have been proposed and investigated. In this paper, we present the first implementation of propnets on Field-Programmable Gate Arrays (FPGAs), showing that they perform between 25 and 58 times faster than a software-propnet for most of the tested games. We also integrate the FPGA-propnet within an MCTS agent, discussing the challenges of the process, and possible solutions for the identified shortcomings.

Cite

CITATION STYLE

APA

Siwek, C., Kowalski, J., Sironi, C. F., & Winands, M. H. M. (2018). Implementing propositional networks on FPGA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11320 LNAI, pp. 133–145). Springer Verlag. https://doi.org/10.1007/978-3-030-03991-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free