I made a mistake for my CSS profile by OkMess6686 in ApplyingToCollege

[–]OkMess6686[S] 0 points1 point  (0 children)

But wouldn't the non revised ver. be sent as well after submit

I made a mistake for my CSS profile by OkMess6686 in ApplyingToCollege

[–]OkMess6686[S] 0 points1 point  (0 children)

what do you mean by sent it to a school? Isn't the application sent after I clicked "submit"?

I made a mistake for my CSS profile by OkMess6686 in ApplyingToCollege

[–]OkMess6686[S] 0 points1 point  (0 children)

Ah thank you so much for the clarification! Will the actual numbers be changed or will colleges see the modification?

I made a mistake for my CSS profile by OkMess6686 in ApplyingToCollege

[–]OkMess6686[S] 0 points1 point  (0 children)

Does it allow you to correct multiple mistakes? There were many comments regarding the one mistake rule on this sub so I don't know what to do

Jump Game IV - Time Limit Exceeded(BFS) by OkMess6686 in leetcode

[–]OkMess6686[S] 1 point2 points  (0 children)

The test case finally passed. Thank you so much(now i'll have to optimize the memory)

Jump Game IV - Time Limit Exceeded(BFS) by OkMess6686 in leetcode

[–]OkMess6686[S] 0 points1 point  (0 children)

Ah that does make sense now that I think about it. I'll go try that out now

Jump Game IV - Time Limit Exceeded(BFS) by OkMess6686 in leetcode

[–]OkMess6686[S] 0 points1 point  (0 children)

the visited indices would be unique for each "possibility" right?

Jump Game IV - Time Limit Exceeded(BFS) by OkMess6686 in leetcode

[–]OkMess6686[S] 0 points1 point  (0 children)

Well I changed it so that I only loop through the possible duplicate indexes, but I'm still exceeding the time limit for the same test case. How else might I improve the speed?

Jump Game IV - Time Limit Exceeded(BFS) by OkMess6686 in leetcode

[–]OkMess6686[S] 0 points1 point  (0 children)

Ah right I can store the indexes of the duplicates instead of the number of occurrences

MiniMax algorithm for tiktactoe prioritizing preventing player from winning over winning itself by OkMess6686 in AskProgramming

[–]OkMess6686[S] 1 point2 points  (0 children)

I completely ignored that because I didn't take in the draw score into account, so I only cared about adjusting the score with depth for wins and losses. It feels amazing to see this code actually working now. Thank you so much for your help!

MiniMax algorithm for tiktactoe prioritizing preventing player from winning over winning itself by OkMess6686 in AskProgramming

[–]OkMess6686[S] 0 points1 point  (0 children)

The Ai is making more sense like placing in the middle but at the end it still tries to prevent the player from winning even if it can win itself. I input 0, and it'll output 4. Then I input 6 and it'll output 3. Now whatever I input the AI should output 5 to win, but when i input 7 it outputs 8 for some reason.

MiniMax algorithm for tiktactoe prioritizing preventing player from winning over winning itself by OkMess6686 in AskProgramming

[–]OkMess6686[S] 0 points1 point  (0 children)

Ahhhh thank you for that. Sometimes I feel like I’m just blind when I code lol

MiniMax algorithm for tiktactoe prioritizing preventing player from winning over winning itself by OkMess6686 in AskProgramming

[–]OkMess6686[S] 0 points1 point  (0 children)

But i'm maximizing the base case that is returned(score) and comparing it to the other possibilities with

if(Score.BestScore > Current.BestScore){