arXiv (All)
open access
Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles
This paper investigates solving and generation techniques for the logic puzzles Hitori and Binairo. Two solving paradigms are compared: backtracking with domain-specific optimizations, and SAT-based solving via conjunctive normal form encodings. An empirical evaluation analyzes runtime, explored sea
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles#789811
- Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency#639746
- On the Nature of Propositions: Truth, Meaning, and Context#96258
- Route-Align-Verify for Functional Correctness in Code Generation#429452
- Prompt Optimization for LLM Code Generation via Reinforcement Learning#204858
Record · ID 793816
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive