12.1b — Grid/Symmetry Jam: Build Day 1

Step 1 — the board as data (list of lists):

const int W = 8; const int H = 8;
private int[,] grid = new int[W, H];       // 0 = empty, 1 = player, 2 = wall...

// or the AP way — a list OF lists:
// grid[ROW][COL] — the exam writes aList[r][c] exactly like this

Print the whole grid to the console each frame for now — Debug.Log(...) row by row. You must be able to READ your board in text before you can trust it in sprites.

Step 2 — one move. The player cursor at (x, y): W/S/A/D changes it by ±1 — but ONLY inside the array's bounds. The two bugs of every grid game, met now:

int nx = x + dx;
int ny = y + dy;
if (nx >= 0 && nx < W && ny >= 0 && ny < H)  // BOUNDS — always
{
    x = nx;
    y = ny;
}

Step 3 — the symmetry hook. Whatever your pitch promised, wire the CHEAPEST version of it today: mirror the cursor on the other half (x2 = W - 1 - x — one line!), or spawn the enemy AI at the mirrored start. That one line IS the design; everything else elaborates it.

Step 4 — lose/win stub. Touch a hazard cell → print "lose"; reach the far cell → print "win". The loop exists even if nothing is drawn.