Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Solvable Sokoban Without a Solver via Diffusion
Sina Baghal
Deciding whether a Sokoban puzzle is solvable is PSPACE-complete (Culberson, 1997): solutions can be exponentially long and there is no short certificate to check. Solvability is a…
cs.AI2025
Solving Pasur Using GPU-Accelerated Counterfactual Regret Minimization
Sina Baghal
Pasur is a fishing card game played over six rounds and is played similarly to games such as Cassino and Scopa, and Bastra. This paper introduces a CUDA-accelerated computational f…