I Am My Own Cipher

 made on 5/10/24, while pondering the possibilities of 14 Minesweeper Variants 2

Suppose an n-by-n minesweeper board is notated such that each row corresponds to a number from 1 to n increasing downward and each column corresponds to a letter from A to the nth letter increasing rightward. There are n mines: one in each row and column. Each column contains its letter at least once as a cipher clue: every letter corresponds to a different number from 1 to n based on the notations for the positions of each mine (e.g. a mine at E4 would imply E=4). The top-left square is safe. How should the board be solved?