Psychic

This program implements a classic “psychic card trick” in which the computer correctly identifies a letter secretly chosen by the user from a 9×3 grid. The grid is initialized by populating a two-dimensional string array with sequential ASCII characters starting at CHR$ 65 (the letter “A”), with a space placed at position (9,3) to keep the count at 26. Before play begins, 30 random swaps shuffle the grid by exchanging arbitrary cells with the fixed center cell (5,2). The trick works by repeating a column-selection and matrix-transposition cycle three times: each round the user’s chosen column is swapped to become column 2, then the entire matrix is rebuilt by reading columns as rows, guaranteeing the chosen letter converges to position (5,2) after three passes. The program then directly reads and displays R$(5,C) as the “psychic” result.

---

Program Analysis

Program Structure

The program divides into four clear phases:

1. Initialization (lines 5–100): Dimensions and populates the 9×3 string array R$ with 26 letters (A–Z) plus one trailing space, then places a space at R$(9,3) to fill the 27th cell.
2. Shuffle (lines 110–170): Performs 30 random swaps, each exchanging a randomly chosen cell with the fixed center cell R$(5,2).
3. Game loop (lines 180–480): Repeats three times: displays the grid, asks the user which column their letter is in, swaps that column to column 2, then transposes the matrix by reading columns as rows.
4. Reveal (lines 490–540): Prints the value at R$(5,C) as the “psychic” answer and offers a replay.

Grid Initialization

Lines 50–90 fill R$(A,B) using the expression CHR$ (61+A*3+B). For A=1, B=1 this yields CHR$ 65 = “A”, and the sequence runs through CHR$ 90 = “Z” at A=9, B=2, with CHR$ 91 = “[” at R$(9,3). Line 100 then overwrites that cell with a space, correcting the 27th slot to a non-letter filler.

The Mathematical Trick

The algorithm is a well-known combinatorial card trick generalized to a letter grid. Each round, swapping the user’s chosen column into the middle column (column 2) aligns the target letter somewhere in column 2. The transposition step (lines 360–460) rebuilds the matrix by treating each original column as a new row: column 1 becomes row 1, column 2 becomes rows 4–6 (positions 4–6 of the new first column, etc.). After three repetitions the chosen letter is guaranteed to occupy position R$(5,2) — the exact center of the 9×3 grid — regardless of where it started.

Transposition Technique

The transposition is performed in two steps. First, a temporary string T$ is built by concatenating all three columns sequentially (lines 370–410), yielding a 27-character string ordered column-by-column. Then the array is refilled from T$ using the index T$(A*3+B-3) (lines 420–460), which maps back to the new row-major ordering.

Key BASIC Idioms

• Column-swap idiom: Lines 310–350 perform a three-way swap of columns C and 2 using T$ as a temporary variable, row by row.
• Input validation: Line 290 uses IF C<1 OR C>3 THEN GO TO 280 to loop until a valid column (1–3) is entered.
• Replay guard: Line 530 uses (T$+" ")(1) to safely extract the first character of the input without risking an error on an empty string — a common defensive idiom.
• Loop-controlled display: The outer FOR I=1 TO 3 loop (line 180) drives both display and column selection; line 300 skips the transposition on the third (final) pass since the answer is read immediately after.

Notable Anomalies

Location	Observation
Line 100	R$(9,3) is set to a space to correct the off-by-one in the CHR$ formula, which would otherwise place “[” (CHR$ 91) in the last cell.
Line 300	When I=3 the program jumps to line 470 (CLS), skipping the column swap and transposition. This is intentional — the reveal uses R$(5,C) with the final column input, so no further rearrangement is needed.
Line 533	GO TO 180: STOP — the STOP after the GO TO is unreachable dead code; execution always branches before reaching it.
Lines 110–170	The shuffle always swaps through R$(5,2), meaning the center cell is statistically far more likely to move than other cells. This is a cosmetic shuffle whose primary purpose is visual randomization of the display, not true uniformity.