৮×৮ দাবার বোর্ডে ৩টি Rook বসবে কতভাবে? | বিন্যাস ও সমাবেশ | UDVASH

[00:01] - [00:02] Antor, you want to stop me? This is not good. [00:06] Checkmate. [00:09] This rook in game is always going to be a problem. Antur, I'll give you an interesting problem. [00:14] At the end by end our boarded [00:17] How can you keep these three rules in a way that no one will be affected? [00:21] That's okay. [00:23] I know the route, but I don't know the way. [00:27] Column can go as far as the body can go. And if he wants, he can go as far as the body can go. So, the problem you gave, it's not a solution. [00:35] Antur, you should think about it. I have a one-by-one application. [00:40] Then I can keep one ingredient in one way. [00:43] Now you can think, I want to use a 2x2. [00:47] We can talk about both of them there. [00:50] We can keep it total. [00:51] Do it again. [00:53] Now, let's say I have a question. [00:57] And how many of these three options can I keep three holes? [01:01] Hit that hotel. [01:01] Try that. [01:03] It didn't actually. [01:04] You can see that it is following a pattern. There is a space in one factory in one by one database. [01:10] 2 by 2 daba bode. [01:11] There are two holes in 2-factor layout and in 3x3 mode [01:15] 3 factors are kept in the key factor [01:18] So, if I had 8 shapes in this 8x8 board, I could have kept 8 fractal shapes. [01:24] So if we want to keep these three groups, [01:26] That's all I'm going to talk about today. [01:28] In an 8x8 scale, I have 8 squares and 8 columns. [01:32] I can choose from 8 to 3. [01:36] and from 8 columns, I can choose 3 columns [01:40] It's a three-way. [01:41] Now, this three sarees and three columns make a three by three board. [01:46] In this 3x3 board, [01:47] 3 is in the 3 factorial. So the final answer is 8c3 * 8c3 * 3 factorial. [01:56] So, if our vote is N by M accuracy, then here I can keep R as MCR into MCR into R factorial so that no one attacks anyone. [02:07] Now think about it. How many bishops can be kept in a single place so that no one attacks them? [02:15] Good luck to all of you who took the problem from the bishop and gave the problem from the knight. The knight's move was not good enough to calculate. [02:23] But the fun part [02:25] But the knight's case is easier than the bishop's. [02:28] Actually, I won't solve this. This is from your side.