N Queens Backtracking Algorithm Confusion

[bennigan88]

Hi, I am trying to understand how to use backtracking to solve the n queens problem. I do not know how to use stacks, and I've never used multidimensional arrays before. I've looked at some pseudocodes for backtracking algorithms, but I still just don't understand. Are there some things I can try to learn first that will make it easier to then understand using backtracking algorithms? I understand the concept, but I don't know how to implement it C++ :/ I do know how to use functions and 1D arrays, and loops. Any guidance would be much appreciated.

(Ideally if anyone can direct me to the code for a solution program that is commented well enough that a first semester CS student could understand each step in the code, that would be fantastic.)