n-Queens Completion problem on the toroidal board solved

I claim that I have found simple and effective solution for the n-Queens completion problem on the toroidal board. The n-Queens problem has some importance inside professional math community, but I am not a professional and this is the first reason why I would like to ask you join in. The math community expects one condensed, professionally written scientific work that sets and explains the claims given in the article, but it is above my knowledge. The n-Queens-completion problem can be seen through the 4 CLAIMS: • Claim-1: the problem is solvable in the polynomial time for any n=p, n=(p-1) • Claim-2: any two preplaced queens are enough to find the exact modular solution and consequently complete the board • Claim-3: the sQuaricon pattern gives in total (p-3) default solutions and respectively (p-3)*p translated solutions • Claim-4: the sQuaricon pattern gives a closed set of the n-Queen modular solutions PROOFS? For Claim-1 I have no any proof, I've just compared several published methods to find the completion solutions and my algorithm looks significantly simpler. Next hunch is that when you solve 1st quadrant i.e. 1/4 of sQ-matrix, then the rest 3 quadrants are symmetries (the lower level of computation?) of the first quadrant. I tried but didn't succeed to understand P vs. NP problem, so I gave up. Claims 2, 3 and 4 are maybe simple to prove, but my math language is outdated, and my knowledge is too poor even for this. This job is for someone of your format. Link to article on Medium com ([login to view URL]@goranumicevic/n-queens-completion-for-n-p-205f6c6397d5) p.s. I can prepare quality graphics