Card Shuffle Adjacency Simulation

Archived study

Simulates repeated shuffles of an ordered deck and counts surviving original neighboring pairs. Example decks and repeated-run summaries show how this adjacency statistic changes under the chosen shuffle model.

Interpretation and limits

Matching a random deck on adjacency alone does not prove that the entire deck distribution is uniform. Conclusions depend on the shuffle algorithm and the limited statistic being measured.

Package and provenance

The original .science export and matching poster are preserved byte-for-byte from the upstream case. The package contains the conversation, session metadata, and the resources inventoried in its internal manifest. This introduction summarizes the archived record; the research, external sources, and model evaluations were not rerun for this import.