Be SMARTER than a CHESS GENIUS in 10 SECONDS | Catch The Hack - Episode 02
HTML-код
- Опубликовано: 12 дек 2024
- After the first episode of Suhani’s Catch the Hack, we thought, let’s do something smarter for some of the smartest people we know of. We’ve seen Chess, Chess streaming, and Chess players on the rise throughout the past few years! And, at the helm of that rise, we have Sagar Shah and Amruta Mokal. They’ve taught numerous people the game of 64 squares and some actually mastered it!
In this episode, Suhani Shah challenges these Chess maestros to a puzzle that’ll leave them befuddled.
➡ Subscribe to the channel for more interesting videos!
/ suhanishah07
➡ Join this channel to get access to perks:
www.youtube.co...
➡ Follow on Instagram: @TheSuhaniShah
/ thesuhanishah
➡ Join the squad on Discord: / discord
➡ Join our SubReddit: / sushasquadop
#SuhaniShah #SagarShah #AmrutaMokal #Chess #ChessPuzzles #ChessMasters #CatchTheHack #SushaSquad #CTH
This is just memorising a solution... The approach from sagar is more critical and better for getting a feel for the problem...
Exactly!!
This series is just stupid
Worst one yet for sure
Exactly
@Siddhartha dash 😂😂
Sagar and Amruta are like those programmers who actually code the entire problem statement, validate the possible cases, test everything.
Suhani is like that one guy who hardcodes everything and shows it to the teacher.
Sagar's approach was much better. All Suhani did was to memorize one of the possible combinations of 8 queens. In AI and Analysis of algorithms, and N queens problem is about placing N queens on an NxN chessboard. If it were this simple then we'd never have to write code for it
Yes like she copy pasted it
Its like memorising things.hats off to sagar for solving it live
It is a popular question taught to Computer Science students in Backtracking Programming problem named as N-Queen Problem.
are bete, i thought would I find some cs guy lol
@@mehul6275 Hi 5!
which college are you from brother ?
Yooo I was looking for this comment..
It's a very common problem 8 queens solved using back tracking and this is not the only solution
Nice vid but as others have pointed out it isn't the only solution - this puzzle has 12 unique positional solutions (92 if one considers rotations & reflections !)
The only symmetrical solution -
(a5, b3, c1,)
(h4, g6, f8)
(d7, e2)
Ok euclid
Can you explain how you came up with this solution? It will be interesting to know the process. 👍
It is explained in some math based yt channel
@@srkeys8143 Okay :) Please link if possible.
@@TheNikhilmishras it's just combinations if you calculate 92 and permutations also if you calculate 12
In Computer Science, there is a field in Analysis of Algorithms, where we have the analysis and development of the same problem, where we have N number of queens on the board and we have to place them in a way that no queen threatens other.
And solve it using Dynamic Programming 😁
@@chiragsahuji3149 Yes bro memories 😂❤
Backtraing+DP😛
N - Queen Problem
I'm a computer science graduate, I don't remember anything like this😂, although I do remember that we used to solve problems using various algorithms.
Magnus be like : Mereko toh aise dhak dhak horela hai
👍🏻🤣😂
Do you seriously think magnus doesn't know this?
Also i 😂😂
@@arnavmehta8606 I think he.don't know the trick most probably
He can definitely solve this but not in 10 sec
@@arnavmehta8606 joke ko joke rahne de bhai.
This is called as 8 queens problem in Computer Science
I am sorry Suhani, but this is not the Hack. Sagar's Approach was much better. Arrange queen in Knights position and just move the one column's queen to last rank. Disspointed this Tuesday. Waiting for next Tuesday.
I did it in just 40 sec without the hack.
Just put pawn in knight manner form file A3,C2,E1. Then, again put on D8,F7,H6. Finally put remaining 2 peices on B5 and G4.
Try yourself out first
0:45
Sagar's line was Smoother than butter..... ✨❤🔥
Computer Science students will recall the famous N queens problem, solved using backtracking
1:40 do the place of knight becoz queen can threat anyone but knight is the only one who threatens her
From the exp of 6years
Suhani, What if there are 3x3, 4x4... nxn dimensions instead of 8x8?
Fact: Sagar will be able to solve.. Approach >>> memorization
For computer science student easy to solve it...
And imp it's has many solution(around 70+ solution)
1. a1, b7, c4, d6, e8, f2, g5, h3
2. a2, b5, c7, d4, e1, f8, g6, h3
Has 1 more trick place 1st queen suppose a1 then either go kight move horizontal or vertical place 4 queen in that way then for 5th queen move opposite of 4 queen( if go hori then for 5th queen move vertical or vice versa) and place queen in same way...
Try it out!!! Awesome puzzle...
Apna homework yaha chap diya 😂
🤣🤣🤣!!
Humari zindagi isi ke aas pass chlri hai!!🤣🤣🤣
0:45 sagar shah smoothie
N queens problem is an NP problem which means there is no "algorithm" as such. The only algorithm is backtracking which is basically trying all possible patterns and hope that you get lucky. 😁😁
yupp
FInally a computer science student
Someone commented they watched a video and figured an algorithm and asked me if I wanted to know. 😂 Of course I would coz that would be game changing to math and CS
@@chaitanyachavali6293 yeah that someone deleted their comment i guess. they must be on their way to winning a million dollar!
@@aryapaar Exactly 😂
Puzzle was great; but the solution, not so much
Waited so long for its part 2🥳🥳🥳
1:46 THE mobile is blurred😂
3:46 "tu kar naaaaaaaaaaaa" lol that was savage reply 😂
I found Sagar's approach more feasible... Memorising a 7-digit number is tough but logic can be remembered easily
Previous one was far much better than this... This is just memorising a solution... No application of mind... If some one ask you what is 10+10..never calculate in mind or use calculator...just remember answer is 20.. ..🤦🤦
This same puzzle was given in our college, this is called the N-queen problem, You can do it with 8 queen and 64 squares or you can also do it with 4 queens and 16 square. Yes i repeat 16 squares. I repetead it so that you don't assume i have written some wrong number, coz humare online class mein bohot confusion hua tha. Koi bola 12,25.... iss liye
4²=16
8²=64
@@RAXITH_playz 👍👍
n queen problem - for placing n queens in an nxn board in a way that no queen threatens another queen.
u can also do it with other values of N. some have solution some might not have
Love this series
Please make it weekly or once in 2 week show and never end it for atleast 6-7 months
(I know there aren't many tricks and games but still) ♥♥❤
Every Tuesday a new Episode
If you dont want to remember i have better hack although it takes 1 min:
8 queens
8 ranks
8 files
But the problem is diagonals
So start with problem
Place 1 queen in center 4 sq
Then place 4 queens below that queen and first see diagonals and then see rank and files
Then place 3 queens above that center queen. You'll easily do in 1 min
Out of 2 8sq long diagonals 1 will be used
Out of 4 7sq long diagonals all will be used
Only count from center don't count edge diagonals.
I also tried to do this on my own, and came up with a better way to solve this. You have to start from a2 square, and instead of knight algorithm, use 3+1/2 algorithm
2:5 this feels so good 💕
It has a very simple mathematical approach which uses only 2 conditions to solve it...1st write the no.s 1 to 8 in such a way that there are no consecutive no.s..nd 2nd condition is the difference between (1st nd 3rd),(2nd and 4th),(3rd nd 5th) nd no.s like that should not be equal to 2...then place the queens on the no.s/rank or column....for example 1,3,5,7,4,2,8,6....nd many more
Loved the starting monologue
Please make this series more
Hum chess ki taraf se hai! And we love this hack 💜
N Queen Problem !!
I love how without any formal education she is so confident
Loving your this series so much ❤❤❤
This is basically the first chess puzzle which is used to give as a task to my students......this is a great way to learn the knight moves and to analyse how knight is different from other pieces
The great thing is that even some U-7 kids solved this puzzle with a little effort
I was waiting for this hack series video
I coded same problem(N-Queens problem) yesterday, it took me less time to code than them solving it on the board 😂😂😂
no one:
Suhani' Title Maker: be smarter than a chess genius in 10 seconds of an "8 MIN VIDEO"
The hack is to remember the positions. Wow!!!! great hack Suhani.
Fun fact There are more than 90 possible solution to this 8 Queen challenge
Why did this stop????😢😢 Suhani Didi please continue 😢😢❤❤
My inorganic teacher said the same, inorganic is very easy you just have to remember exceptions
😭😭😭
Suhani would have done great in school given that her solution to the problem was memorisation.
How is it a hack? She is just remembering a solution.
It is popular problem in backtracking, every CSE student must know this.
Let me tell you one extra knowledge, The solution given by Suhani is not the only solution. There are total 92 solutions to this out of which one was given by suhani, and the other by sagar.
Love this series 💖💖💖
So GUYS THE supper clever Hack is you solve it and just remember the position
hence proved, 8 queens are alot to handle in life
At the end Susha OP ! ❤️😊
0:45 ❤️❤️❤️
It's amazing but this puzzle is one of the popular chess puzzle. If you Google also you can found it with tricks and this is even in RUclips. So this is not new but still Amazing ❣️♥️♥️ Want more hacks as in EP 1 and interesting chess hacks .
Firstly, new intro is superb. . Kudos for the intro. .❤️❤️🔥🔥 secondly, thanks for the amazing hack. . And releasing it during CSL adds a new dimension to it. .🔥🔥🔥🔥🔥
That was really gud 👌nice
I challenged myself to do this without the solution and I got this solution -
A4 b6 c1 d3 e1 f7 g5 h2
I paused this video, took out my chessboard and completed the challenge in less than a minute.. I've never been this proud of myself 🤩🤩🤩
how
damn🔥🔥🔥🔥i was waiting so long for this episode to release suhanidi with sagar and amruta after seeing your clips on chessbase india's channel i knew something crazy is going to happen😍😍😍😍
#SUHANIDialwaysRocks❤️❤️❤️❤️
#SagarandAmruta❤️❤️❤️❤️
#CATCHTHEHACK#E2🔥🔥🔥
Really amazing😃👍❤
This is awesome Suhani...🤘✌
What's the point in remembering a sequence and then getting it right
Sagar's strategy was much better
This ain't hack :( it's called memorizing the solution
Me after hearing suhani's hack : koi sense he iss baat ka
I did it in just 40 sec without the hack.
Just put pawn in knight manner form file A3,C2,E1. Then, again put on D8,F7,H6. Finally put remaining 2 peices on B5 and G4.
Try yourself out first.
Thank me later
N queens problem of computer science ,I think these are hacks which are just for show off only nothing to be proud of but kudos and huge respect to sagar Shah Ji to make a logic around it and solved it ❤️❤️
Absolutely, that's what suhani said when she started this series... These are just for fun, no benefit
He use DP + backtracking 😂
@@gharud_xd6812 With O(n!) time complexity. 😂
Keep it up Suhani.🥳🥳🥳
N queen people exists
CSE guy - hold my recursion 🙂
No bro use DP
@@gharud_xd6812 I would rather go brute force , you gotta problem mate?
@@vishalthakur1555 yap time and space complexity
Amazing Suhani broooo 🥳🥳🥳
Nice info 😀I love it 😘😘❤️
Aag laga di 🔥🔥🔥🔥🔥
I'll never forget to watch the new episode of "Catch The Hack" on Every Tuesday 😘😘❤️
Keep It Up 😉😘❤️
This is not a hack 🙄this is just memorising the solution, and do you remember suhani you once said that coders are not creative, any avg coder can solve this problem with any size of chessboard not just regular one.so don't think as if you are the samrtest, there is always someone better than you.
Computer science students be like.. give me my laptop and I can do it in mili seconds 😎
This is an interview question in Backtracking Topic of Programming
Well i guess the previous episode was way much better.
Because in this one you've to just memorise one of the many possibilities and it's hacked.
And yes Sagar Op 🔥🔥
There are total 92 solutions and it's a classic puzzle of all time.
Kudos to the Content Queen 👑
Kya gazab maza aara hai iss series mein ❤️🔥
After solving the puzzle and memorizing the position he could have called it a hack
So will Sagar Shah be a GM after watching this Video ? 😂
8+8= ??. (Are you guys adding the numbers in brain, calculator or finger?? No need just remember the answer its "16" ) 🥳🥳
All Grandmasters: toh ab kya hum job chod de..
If you want to find easy tricks in any game just teach that game to suhani than see the magic.. nice video. #SushaOP #SushaSquadOP
Bad memories of recursion for computer science students 🤣 N Queens problem
Why use recursion when you have dp and backtrack 😉
Talking frankly this was not lika a hack it was just a puzzle which she gave the answer of
N-Queen Problem.... CS Students would know!
Ian nepo after seeing the video
Magnus world champion who??
😅
First of all I can't understand the question😂, but I am enjoying to watching your video😍💝✨
actually i also did it before sagar time in just 5 min without trick
waiting for Suhani to solve the n queens problem on a n X n board
I cant believe I got it before Sagar....in about 6 min
Hikaru be like wait wait wait whatt😳
The outro makes me anxious
Just ammazzzzing 🔥🔥
8 queens problem
very popular problem taught in cse
Can anyone plz tell me where does this hack work I cannot get it..
The person who makes the best contents
After listening to the rules of the puzzle I solved it within 10s on the chess board. Feeling somewhat proud of my self.. *self pat*
I am actually surprised, that samay has not yet commented on the video
He must be busy with csl
is it crazy that i just did it in 1 minute????
Good one... 😊
Prediction : One of the episodes will be with Rohan Joshi
hahahah so smart 😒
@@Suveer5518 thankyou bro 😂😂
Any programmer can relate to it 😅 Backtracking !
How is it a hack if you are memorizimg a solution😑😑
Ae Suhani Ye trick nahi ,Ratta hai 😂😂😂😂
You are epic suhani gyzz please support this girl we are proud of you on be a indian god bless you and keep it up ☺️
what if we make the chessboard small let's say 5x5 and now place just 5 queens ...where is the hack now???
she will have to learn another code for it lmao