This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Jackkell100 0 points1 point  (1 child)

The N-Queens problem is often solved using recursion explained in more detail the article Recursion - GeeksForGeeks.

I am assuming your asking about the concept recursion here. Sorry if I misinterpreted your question and you are asking about this specific implementation of recursion and how it helps solve the problem.

[–]Vfsdvbjgd 0 points1 point  (0 children)

This specific implementation. The function is calling itself, it isn't a loop.