And Sir, we don't have to check anything until any of zero or cross move at least 3 times, in other words at least 5 box should be filled or 4 moves should pass before doing any checking, and i observed that first mover can play at most 5 times and second mover can play at most 4 times, can we use that fact for efficiency.
hello! look at this.making use of a two dimensional array,write the code that permits two players to play a game of tic tac toe (also known as noughts and crosses). use 0 to represent an empty square.1 to represent a cross, and 2 to represent a nought. this requires implementing several algorithms; asking for the user`s input and placing their symbol looping between two different players alternating the symbol checking for a win. must be done in java. show the pseudocode and the java code
Ya, I was also thinking the same thing. The first thing we need to do is have an if the check for the total no of turns in case they exceed 4. if they exceed we can start our logic. Also, one more idea I was getting is instead of having 8 checks (row, column, and diagonals) why not reduce the check. I mean when ever a user selects a value (say position 8) let's check all possible combinations with that position that would reduce the checks to max 3. (positions [0,4,8],[2,5,8][6,7,8])
I absolutely loved your explanation sir. I thought of making this game from last 5 months, but I couldn't make it. I decided to make a game till the end of 2021. So I sat at 11:30pm on 31st dec 2021, I saw the TITLE of the video is interesting and started watching, It was so impressive and I started making own cases and started writing code. I divided the progress of game into small parts/tasks and Finally at 1:30 I completed. However the code is very big. But the game is just with if else and loops. I was motivated a lot with this video and just wanted to share. Thank you very very very very much sir. And make some more logical videos like this. STAY SAFE.
We can make the code more efficient by creating a 3x3 matrix from a 2D array and then running 2 loops to check conditions for horizontal and vertical boxes.
Thank you so much sir the way you explain it looks how simple and I am able to understand this logic and able to think thanks alot , I came up here from your react native series
Just thinking about that and not wanted to take any kind of help from internet but as I don't want to miss any of your video. I watched it and its damn simple logic.
this guy is great, his udemy on angular is what everyone else should aspire to, also i often have trouble understanding indian accents on courses, but this guy has amazing english language speaking ability and his courses are to the point - new favourite of mine :)
optimization: The first thing we need to do is have an if the check for the total no of turns in case they exceed 4. if they exceed we can start our logic. Also, one more idea I was getting is instead of having 8 checks (row, column, and diagonals) why not reduce the check. I mean whenever a user selects a value (say position 8) let's check all possible combinations with that position that would reduce the checks to max 3. (positions [0,4,8],[2,5,8][6,7,8])
nice one. here is a question.making use of a two dimensional array,write the code that permits two players to play a game of tic tac toe (also known as noughts and crosses). use 0 to represent an empty square.1 to represent a cross, and 2 to represent a nought. this requires implementing several algorithms; asking for the user`s input and placing their symbol looping between two different players alternating the symbol checking for a win. must be done in java. show the pseudocode and the java code
no need to scan all rows , cols & diagonals to decide winning state, if u changed any cell and it is not corner cell then just check corresponding row & col, else you will have to consider corresponding diagonal as well . so in after each u have to either check for (row & col) or (row, col & dig) to decide winning state. this question is not about how do u decide winning state after each move, it is more how efficiently u decide :)
8:29 sir haven't cut that seen because he want to show that yes professionals also makes mistakes That builds a connection between teacher and students But it's he didn't hide the mistakes he accepted it Salute you sir
I still remember that because of this fu@#ing problem I left learning java and app development. I was learning on my own, doing Head first java, everything was going smooth and then this problem appeared, wasted almost 4-5 days, was lost in college stuff and ultimately never did again...
In C pos[i] will be filled up with garbage value if the player have not played any move there so we can simply check (for the horizontal case) if pos[0]==pos[1] and pos[1]==pos[2] so if the player have not filled out any of the places it will not match anyway because of the garbage value concept. I tried to code that with this logic and found some strange error which says that the subscripted value is not either array nor pointers nor vectors . I just want to know if I am thinking correctly , and this error is occurring because of my logic or not.
tic tac tae !!!!! tic tac tak :::: hitesh sir some times mashed up in pronunciation and i really enjoyed funny comments in middle of lecture and i never bored when watching his lecture.
yeah another method I use is just write 1 if statement then add condition using OR like if ( pos[0] == pos[1] == pos[2] or pos[3] == pos[4] == [5] or.... )
Sir I enjoyed this video please make more video to raise the ability of logical thinking. Well I also teach PHP and JavaScript at my RU-vid channel with the help of project. Sir you are my inspiration.
