Metraipolis › archive › dc_62e412563b7a

Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem — arXiv:2609.25056

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25056
License (as archived)
CC0-1.0
Archived
2026-10-08T14:34:19.681Z
SHA-256 of the archived text
da301f2d99a6a0dc991bf5db584c851bf7d19c8627315162b09c6f6071872bd3
Stable URL of this page
https://metraipolis.com/documento/dc_62e412563b7a

How to cite

Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem — arXiv:2609.25056 — arXiv (en), https://arxiv.org/abs/2609.25056 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_62e412563b7a (Metraipolis archive dc_62e412563b7a, sha256 da301f2d99a6a0dc991bf5db584c851bf7d19c8627315162b09c6f6071872bd3)
BibTeX
@misc{dc62e412563b7a,
  title = {Graph-Based Inference for Feedback-Driven Word Deduction: A Scalable Framework for the Jotto Problem — arXiv:2609.25056},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25056},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_62e412563b7a; sha256 da301f2d99a6a0dc991bf5db584c851bf7d19c8627315162b09c6f6071872bd3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25056. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A feedback-based word deduction framework based on the Jotto problem is proposed, and the problem space is represented as a weighted graph where all valid words correspond to nodes, and the edge weight is defined by the number of common letters between the two words. Finally, the gameplay is defined as an iterative constraint propagation mechanism where feedback is used to iteratively narrow the incompatible space of the graph, facilitating the reduction of the hypothesis space in a structured and interpretable manner. In contrast to existing approaches, where the problem space is typically defined for fixed-length isograms, the proposed framework generalizes to variable-length words (between 3 and 8 letters) and naturally extends to repeated letter cases, facilitating the treatment of realistic Jotto problem instances within a unified framework for the first time. The proposed framework's applicability and solver dynamics are also discussed through an interactive implementation and a qualitative case study, respectively. Significant automated tests on approximately 3,000 simulated gameplay scenarios identify a novel convergence behavior: the expected number of iterations diminishes with increasing word length. A strong relationship is confirmed using statistical tests to verify a logarithmic relationship, which is also verified using regression modeling and goodness-of-fit tests. In addition to the initial problem statement, this formulation introduces graph pruning as a viable paradigm for feedback-driven inference with interpretability and its association with symbolic reasoning and interactive intelligent systems.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-23 in cs.CL).
Categorie arXiv: Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2609.25056 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:46:15.658Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).