PuzLM: Solving Jigsaw Puzzles with Sequence-to-Sequence Language Models

Gur Elkin, Ofir Itzhak Shahar, Ohad Ben-Shahar
11/9/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Square jigsaw puzzles are typically solved by visually matching piece images to recover the original layout. This work introduces PuzLM, an alternative perspective that recasts jigsaw reassembly as a discrete sequence-to-sequence (Seq2Seq) problem, inspired by natural language representations. We design an efficient puzzle quantization procedure that transforms each piece into a short sequence of discrete tokens, enabling the direct application of standard Seq2Seq language models as powerful jigsaw solvers. Our approach demonstrates that accurate puzzle reconstruction can be achieved through purely symbolic reasoning over discrete representations, improving state-of-the-art performance even on puzzles with eroded boundaries or missing pieces.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{elkin2025puzlm,
  title  = {PuzLM: Solving Jigsaw Puzzles with Sequence-to-Sequence Language Models},
  author = {Gur Elkin and Ofir Itzhak Shahar and Ohad Ben-Shahar},
  year   = {2025},
  eprint = {2511.06315},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.06315v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.06315.svg)](https://codeofpaper.com/paper/2511.06315)

Discussion