23 citations · 53 across the 21 of their papers we have counts for
8 papers · 1 filter
Baba is LLM: Reasoning in a Game with Dynamic Rules
Fien van Wetten, Aske Plaat, Max van Duijn
Large language models (LLMs) are known to perform well on language tasks, but struggle with reasoning tasks. This paper explores the ability of LLMs to play the 2D puzzle game Baba…
Research Re: search & Re-search
Aske Plaat
Search algorithms are often categorized by their node expansion strategy. One option is the depth-first strategy, a simple backtracking strategy that traverses the search space in…
Why Local Search Excels in Expression Simplification
Ben Ruijl, Aske Plaat, Jos Vermaseren +1
Simplifying expressions is important to make numerical integration of large expressions from High Energy Physics tractable. To this end, Horner's method can be used. Finding suitab…
HEPGAME and the Simplification of Expressions
Ben Ruijl, Jos Vermaseren, Aske Plaat +1
Advances in high energy physics have created the need to increase computational capacity. Project HEPGAME was composed to address this challenge. One of the issues is that numerica…
Nearly Optimal Minimax Tree Search?
Aske Plaat, Jonathan Schaeffer, Wim Pijls +1
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called…
SSS* = Alpha-Beta + TT
Aske Plaat, Jonathan Schaeffer, Wim Pijls +1
In 1979 Stockman introduced the SSS* minimax search algorithm that domi- nates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that i…