Muhammad Maaz (@1devmaaz) header
Muhammad Maaz (@1devmaaz) profile picture

Developer, passionate about AI and startups. Sharing my journey and more high-quality content

Portfolio
Joined April 2021
๐—”๐—น๐—ฝ๐—ต๐—ฎ-๐—•๐—ฒ๐˜๐—ฎ ๐—ฃ๐—ฟ๐˜‚๐—ป๐—ถ๐—ป๐—ด โ€” ๐— ๐—ถ๐—ป๐—ถ๐—บ๐—ฎ๐˜…, ๐—ฏ๐˜‚๐˜ ๐—ฆ๐—บ๐—ฎ๐—ฟ๐˜๐—ฒ๐—ฟ ๐Ÿง  Minimax explores possible future moves to find the best decision. The problem? โš ๏ธ Game trees get huge. โ– ๐—”๐—น๐—ฝ๐—ต๐—ฎ-๐—•๐—ฒ๐˜๐—ฎ ๐—ฃ๐—ฟ๐˜‚๐—ป๐—ถ๐—ป๐—ด โ†ณ It skips branches that cannot possibly change the final decision. โ— ฮฑ (alpha) โ†’ best value MAX can already guarantee. โ— ฮฒ (beta) โ†’ best value MIN can already guarantee. โžข When ฮฑ โ‰ฅ ฮฒ, stop exploring that branch. That's the pruning. โ– ๐—ฆ๐—ถ๐—บ๐—ฝ๐—น๐—ฒ ๐—ฒ๐˜…๐—ฎ๐—บ๐—ฝ๐—น๐—ฒ โ†ณ Suppose MAX is already found: Left branch โ†’ 3 So: โ†’ ฮฑ = 3 Now MIN explores another branch: โ†’ Right branch โ†’ 2 MIN can only make this branch 2 or worse. โ˜ž MAX already has 3. So why explore the remaining moves? โ†ณ Prune. โœ‚๏ธ โ– ๐—ง๐—ต๐—ฒ ๐—ถ๐—บ๐—ฝ๐—ผ๐—ฟ๐˜๐—ฎ๐—ป๐˜ ๐—ฝ๐—ฎ๐—ฟ๐˜ Alpha-beta pruning gives the same answer as minimax. It simply avoids computations that don't matter. โžค Better move ordering โ†’ more pruning. โžค Worst case โ†’ still exponential. โ˜… Minimax: Explore the possibilities. โ˜… Alpha-Beta: Explore only the possibilities that matter. โ˜› Would you be able to identify where pruning occurs in a game tree?
1
4
96
๐Ÿฆ€ Rust: The language that makes memory safety feel like a superpower ๐Ÿš€
1
1
4
178
Just 6 more to hit 1600 followers ๐Ÿš€
1
1
2
116
๐—ง๐˜„๐—ผ ๐—ฃ๐—ผ๐—ถ๐—ป๐˜๐—ฒ๐—ฟ๐˜€ ๐— ๐—ฎ๐—ฑ๐—ฒ ๐—ฆ๐—ถ๐—บ๐—ฝ๐—น๐—ฒ ๐—ถ๐—ป ๐—ฆ๐—ฒ๐—ฐ๐—ผ๐—ป๐—ฑ๐˜€ ๐Ÿš€ โ†ณ Two Pointers is one of the most useful DSA patterns for efficiently solving array and string problems. โ†ณ Instead of checking every possible combination, you use two pointers that move through the data intelligently. โ– ๐—›๐—ผ๐˜„ ๐—ถ๐˜ ๐˜„๐—ผ๐—ฟ๐—ธ๐˜€ โ— One pointer starts from the left. โ— The other starts from the right. โžข Both pointers move based on the current values. โ– ๐—ฆ๐—ถ๐—บ๐—ฝ๐—น๐—ฒ ๐—ฒ๐˜…๐—ฎ๐—บ๐—ฝ๐—น๐—ฒ Find two numbers that add up to 10: Sorted array โ†’ [1, 3, 5, 7, 9] โ˜œ Left = 1 โ˜› Right = 9 1 + 9 = 10 โ˜… Found it immediately. โžข If the sum is too small โ†’ move the left pointer forward. โžข If the sum is too large โ†’ move the right pointer backward. โžข Keep moving until the pointers meet. โš  This works because the array is sorted โ€” that's what tells you which direction to move. Unsorted array = no shortcut. โ– ๐—ช๐—ต๐˜† ๐—ถ๐˜ ๐—บ๐—ฎ๐˜๐˜๐—ฒ๐—ฟ๐˜€ โ†ณ A brute-force solution may check every possible pair. Two Pointers can often reduce the problem to O(n) time. โ˜… ๐—ง๐—ต๐—ฒ ๐—บ๐—ฒ๐—ป๐˜๐—ฎ๐—น ๐—บ๐—ผ๐—ฑ๐—ฒ๐—น โ†ณ Two pointers + smart movement = fewer unnecessary comparisons. โ†ณ This post covers the opposite-ends variant โ€” pointers starting apart and moving toward each other. Once you recognize the pattern, many array and string problems become much easier. โ€”โ€” What DSA pattern should I explain next? ๐Ÿค” โ€”โ€” ๐Ÿ”– Save for later. ๐Ÿ‘ค Follow me @1devmaaz, for more!
2
3
5
136
19/ The key idea is simple: AI search isn't about magically finding the answer. It's about exploring possibilities intelligently until it finds a path to the goal. Once you understand states, actions, transitions, and the frontier, algorithms like BFS, DFS, and A* stop feeling like complicated algorithmsโ€”and start feeling like different strategies for solving the same problem. The real question isn't โ€œCan we find a path?โ€ It's: โ€œWhich path should we explore first?โ€ ๐Ÿง 
1
18
15/ There's also something called path cost. Not every solution is equally good. Imagine two routes: ๐Ÿš— Route A โ†’ 5 km ๐Ÿš— Route B โ†’ 20 km Both reach your destination. But if we're minimizing distance, Route A is better. So we assign a numerical cost to paths to see which solution is more optimal. The best solution is the one with the lowest path cost.
1
8
13/ For example: Imagine the frontier contains: โ†’ [A, B, C, D] If we always remove the oldest node first: A โ†’ B โ†’ C โ†’ D That's essentially Breadth-First Search. If we remove the newest node first: A โ†’ D โ†’ ... That's Depth-First Search. Same problem. Same nodes. Different frontier behavior.
1
7
11/ But what exactly is a "node"? A node stores information about a particular point in our search: ๐Ÿ“ State ๐Ÿ‘จโ€๐Ÿ‘ฆ Parent โšก Action ๐Ÿ’ฐ Path cost The parent is especially useful. Why? Because when we finally reach the goal, we can follow: Goal โ†’ Parent โ†’ Parent โ†’ Parent โ†’ Initial State And reconstruct the entire solution.
1
1
11
10/ But how does the computer actually search? We need one more idea: The Frontier Think of the frontier as a waiting room for possible paths. The algorithm puts the starting node into the frontier. Then: 1. Take a node out 2. Check if it's the goal 3. If not, expand it 4. Add its possible next nodes 5. Repeat That's the basic search loop.
1
1
14
8/ Put those ideas together: ๐Ÿ“ State โ†“ โšก Action โ†“ ๐Ÿ“ New State โ†“ โšก Another Action โ†“ ๐Ÿ“ New State Eventually: ๐Ÿ“ Current State โ†’ ๐ŸŽฏ Goal State All the states we can reach form the state space.
1
2
11