Thread has been deleted
Last comment
help plz c++
Palestine muzaftw 
Im in middle of an exam guys the question is: Given an NxN chessboard determine the maximum number of queens you can place such that no queens will fight each other. using .if else and switch commanda Help guys thxxxx
2017-05-13 02:31
Topics are hidden when running Sport mode.
21
2017-05-13 02:34
#3
jOELZ | 
United States BobZaggot 
Lmao if you struggle with this stop trying to learn coding
2017-05-13 02:36
its just a minor subject dude...my course is CE i wont face that sh*t again
2017-05-13 02:37
what to learn then
2017-05-13 02:50
N queens, trust me.
2017-05-13 02:39
Only if N>3 I think...
2017-05-13 03:28
... just put them all in a diagonal, so for NxN it would just be N
2017-05-13 02:40
30mins left dude
2017-05-13 02:41
shit mb forgot how chess works here en.wikipedia.org/wiki/Eight_queens_puzzl..
2017-05-13 02:42
I dont even know how to play chess
2017-05-13 02:44
#14
 | 
World Imacuck 
Ur fukt
2017-05-13 02:59
It's DFS backtracking. Build one row at a time and go back if current row violates the queen move rule.
2017-05-13 03:04
I don't see simple solution without arrays, too much hard coding here. Can u use arrays ?
2017-05-13 03:06
it's okay bro i figured it out lmao
2017-05-13 04:31
#20
 | 
Portugal DeadStar 
That is not even a c++ question, it's more like a brain teaser
2017-05-13 04:48
Nexus
2.61
LDLC
1.47
FATE
2.08
Illuminar
1.75
LDLC
2.85
Illuminar
1.40
Bet value
Amount of money to be placed
Winning
Odds total ratio
-
Login or register to add your comment to the discussion.