Ok heres my crazy source layout idea: two players take turns writing programs(1) in the same NxN(2) grid, the game ends when a player can't write a program that fits in the remaining space on their turn, the person who has taken up the least(3) space in the grid wins
problems/notes:
(1) What programs are they writing? is it always the same or does it vary? Do both players use the same language?
(2) How can this grid size be chosen?
(3) Making it be "take up the least space" seems in the spirit of golfiness / making your opponent do a lot by doing little yourself, and prevents cheesing by w…