🎓How I Study AIHISA
📖Read
📄Papers📰Blogs🎬Courses
💡Learn
🛤️Paths📚Topics💡Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts5

Category

🔷All∑Math⚙️Algo🗂️DS📚Theory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#xor
∑MathIntermediate

Sprague-Grundy Theorem

Sprague–Grundy theory turns every finite impartial game (normal play) into an equivalent Nim heap with a size called the Grundy number.

#sprague-grundy#grundy number#mex+11
∑MathIntermediate

Game Theory - Nim

Nim is a two-player impartial game with several piles where a move removes any positive number of stones from exactly one pile.

#nim#game theory#xor+11
∑MathIntermediate

Game Theory - Calculation Techniques

Sprague–Grundy theory converts any impartial, normal-play game into an equivalent Nim heap using a Grundy number.

#sprague-grundy#grundy numbers#nim-sum+12
⚙️AlgorithmIntermediate

2-SAT

2-SAT solves Boolean formulas where every clause has exactly two literals, and it is solvable in linear time relative to the size of the implication graph.

#2-sat#implication graph#strongly connected components+12
🗂️Data StructureIntermediate

Binary Trie for XOR

A binary trie (also called a bitwise trie) stores numbers by their binary bits, branching on 0/1 at each level.

#binary trie#bitwise trie#xor+12