Great ! Again this is wonderful. I have found some books where the alogrithm is to place queen columnwise and to try out all the possibilites row-wise and author just does opposite, great piece of work !!!!!
@@gauravpandey5918 The placement of First Queen at frst position led to the current implicit tree and the deadend is reached, no further solutions are possible by working on Q2 and Q3. We backtraced to the initial position to find other possible solutions. N! combintions possible and since N! is not defined in the class of functions. So, Big Oh of Exponential Complexity ! Hope it makes sense !!!
Really wonderful lecture but In some places you could've explained properly because I felt difficult in some part of your teaching but still maximum you have done your best.
@@shoaibshaik1507 i think its too late ... but if u dont im saying.. in 3 1 there is no other row to increment and check.. so we gone back tracking again from there..so from there the last queen is 0 0
@@SuRya-ru3xo not the problem with phn. There is 2x speed option for a reason and I'm using it for that specific reason it is made for. So maybe think from other side of the table.
Kyu yeh sab faltu ka karvate jab saaf saaf dikh rha kaha place ho sakti to sidhe place karo na kyu har jagah check karna hai ?😌 Ya fir horse ki tarah chalo
@21:00 after (3, 2) u have to go for 2,3 right??
Yeahhh need reply for this mam
Mam at 21.00 why u r removing (0)(0) u have to remove (3)(2)
Their (3)(1) q should be remove ,we Got that q according to qat(0)(0)so we should remove that q.
Great ! Again this is wonderful. I have found some books where the alogrithm is to place queen columnwise and to try out all the possibilites row-wise and author just does opposite, great piece of work !!!!!
Plz can you tell me the name of th book
Vinayak Santosh suggests me thanks vinayak
why does the 2nd queen is removed when backtracking at 20:36
Mam in the last case last placed is b[3][1] element why we are removing b[0][0] element
Because that Element is already at last row
@@gauravpandey5918 The placement of First Queen at frst position led to the current implicit tree and the deadend is reached, no further solutions are possible by working on Q2 and Q3. We backtraced to the initial position to find other possible solutions. N! combintions possible and since N! is not defined in the class of functions. So, Big Oh of Exponential Complexity ! Hope it makes sense !!!
Would you please elaborate on the time and space complexity? Thanks!
Ur class is just awesome....love that I just get everything.....
Excellent💯👏 teaching mam superb
Ma'am after 8:05 column will be 2 row will be 1 but you are taking row as 0 why?
it will lengthy for 8 queen problem, will 8queen prob come in semester exams?
Mam can i get code by this algorithm
Awesome!teaching in next video like want too know all possibilities chess board.so that playing chess queen position bit obscureble😇
Can you solve 8 queen problem using that method?
I have a problem, idk how to solve this Algorithm. 12 Queens into 8x8 Chessboard but all Queens not attack each other. How to solve this problem?
Life Saviour 💯💯
I love you mam,
thankyou so much for the great explanation...
Yendi love you you seputhuuu
Awzmmm misss....thankuuu
Really wonderful lecture but In some places you could've explained properly because I felt difficult in some part of your teaching but still maximum you have done your best.
I cant understand why u r removing 0 0 and where is the 3 1 cell queen how u can draw this table without 3 1 cell queen
Because if we do this then we can not increment row by 1 as the number of row is only 3(0-3)....that's why she was removing (0,0)
@@KavyanshPandey thanks i was also stuck there
I love ur teaching
Why you not remove the last queen that was 3 row and 1 colomn
thankyou so much for the great explanation...
Superb madam
I m a fan of ur teaching
Nice mam
I also a fan mam
Can u explain 8queen problem
Can you give a soft copy material
very helpful material
@18:00 mam it will be 2+3 but u did 1+1
Why u r removing 0 0 why u r not removing 3 1
OMG same doubt sister..? If u know tell me
@@shoaibshaik1507 i think its too late ... but if u dont im saying.. in 3 1 there is no other row to increment and check.. so we gone back tracking again from there..so from there the last queen is 0 0
Play at the speed 2x for better understanding😅😅
Awesome mam.. Tnq
Very nice mam
I played all her video at 2X
me too
why bro any prblm with your phn
@@SuRya-ru3xo not the problem with phn. There is 2x speed option for a reason and I'm using it for that specific reason it is made for. So maybe think from other side of the table.
@@SaneCreation chill bro
thysm for explain it in easy way
Superb!
Thank u mam❤
Great mam
Thanks
Thank you Ma'am
Play at the speed of x1.25
me at 2x
Mam i need an explanation for algorithm
Plz explain right way you are not following incremental in same way
x1.5 is fine
thnXX man you saved my time
Really u saved my time
Explaination is wrong after second queen placed why didn't go colum 3 for queen 3 I think ur explaination is wrong 😂
nice mam
TCS MCA SASTRA hit like🤣🤣🤣
For 8 queen problem
Paper may baaki questions bhi hote hai. Isay karte karte to meri umar beet jaaegi 😭
Yu making problem so lengthy , first yu have put q in r=1 and c=0
Tysm
Kyu yeh sab faltu ka karvate jab saaf saaf dikh rha kaha place ho sakti to sidhe place karo na kyu har jagah check karna hai ?😌 Ya fir horse ki tarah chalo
😁😘
Love you
Lol😂
Pronounciate properly
Video is totally wrong.. Remove this video..
whyy???