arXiv:2609.22245v1 Announce Type: new
Abstract: Large language models can produce fluent explanations for chess moves, but plausible language does not necessarily reflect the reasoning behind a decis...
By Angelina Parfenova
arXiv:2608.27757v1 Announce Type: new
Abstract: Searchless chess networks reach human master strength from a single forward pass by imitating a stronger teacher: the strongest, Leela Chess Zero's (Lc...
By Szymon Mi{\l}osz, Piotr Duch, Szymon Grabowski
arXiv:2606. 04860v1 Announce Type: cross Abstract: Finding optimal solution paths for combinatorial puzzles like the Rubik's Cube, sliding tile puzzles, and Lights Out remains a classical challenge in artificial intelligence.
By Siddharth Sahay
The paper presents a method for generating creative chess puzzles using masked diffusion models that can be conditioned on tactical themes and partial board positions. It introduces an auxiliary best‑move prediction task that boosts solution uniqueness by 11.6% and theme‑conditioning accuracy by 2.5%. A reinforcement learning framework further increases the yield of unique, theme‑matching puzzles by 89.1%, and the authors release open‑weights models for the community.
By Aatu Selkee, Severi Rissanen, Xidong Feng, Tom Zahavy, Eric Malmi
arXiv:2607. 20952v1 Announce Type: new Abstract: Latent, or silent, reasoning lets language models carry out intermediate computation in continuous vector space instead of words, and is widely assumed to function as an internal scratchpad the model actively consults during inference.
By Ishan S. Kshirsagar
arXiv:2609.16056v1 Announce Type: cross
Abstract: Humans carry behaviour knowledge of how to act in familiar situations into every new task rather than relearning it from scratch. There is no reason...
By Norbert Oswald, Fabian Deuser, Thomas Br\"aunl