diff --git a/games/logic/reverse_hangman/game.py b/games/logic/reverse_hangman/game.py
new file mode 100644
index 0000000..f16a006
--- /dev/null
+++ b/games/logic/reverse_hangman/game.py
@@ -0,0 +1,139 @@
+from collections import Counter
+
+AUTHOR = "Atharv-AC"
+
+WORDS = [
+    "python",
+    "script",
+    "terminal",
+    "program",
+    "variable",
+    "function",
+    "computer",
+    "keyboard",
+    "monitor",
+    "internet",
+    "database",
+    "network",
+    "binary",
+    "system",
+    "memory",
+    "rocket",
+    "planet",
+    "garden",
+    "castle",
+    "bridge",
+    "forest",
+]
+
+
+def get_best_letter(candidates, guessed):
+    counter = Counter()
+
+    for word in candidates:
+        for letter in set(word):
+            if letter not in guessed:
+                counter[letter] += 1
+
+    if not counter:
+        return None
+
+    return counter.most_common(1)[0][0]
+
+
+def get_letter_positions(letter, length):
+    while True:
+        raw = input(
+            f"Enter positions for '{letter}' (1-{length}, comma-separated): "
+        ).strip()
+
+        try:
+            positions = [int(value.strip()) - 1 for value in raw.split(",")]
+
+            if not positions:
+                raise ValueError
+
+            if len(set(positions)) != len(positions):
+                print("Please do not enter the same position twice.")
+                continue
+
+            if any(position < 0 or position >= length for position in positions):
+                print(f"Positions must be between 1 and {length}.")
+                continue
+
+            return set(positions)
+
+        except ValueError:
+            print("Please enter positions like: 1,3,5")
+
+
+def matches_positions(word, letter, positions):
+    actual_positions = {
+        index for index, character in enumerate(word)
+        if character == letter
+    }
+    return actual_positions == positions
+
+
+def run():
+    print(f"Game by {AUTHOR}")
+    print("=== Reverse Hangman ===")
+    print("Think of a secret word.")
+    print("When a letter is present, enter all of its positions.")
+    print("Use 1-based positions, for example: 1,3,5\n")
+
+    while True:
+        try:
+            length = int(input("Enter the length of your word: "))
+            break
+        except ValueError:
+            print("Please enter a valid number.")
+
+    candidates = [word for word in WORDS if len(word) == length]
+
+    if not candidates:
+        print("Sorry, I don't know any words of that length.")
+        return
+
+    guessed = set()
+
+    while len(candidates) > 1:
+        letter = get_best_letter(candidates, guessed)
+
+        if letter is None:
+            break
+
+        guessed.add(letter)
+
+        answer = input(
+            f"Is the letter '{letter}' in your word? (y/n): "
+        ).strip().lower()
+
+        while answer not in ("y", "n"):
+            answer = input("Please enter y or n: ").strip().lower()
+
+        if answer == "y":
+            positions = get_letter_positions(letter, length)
+            candidates = [
+                word
+                for word in candidates
+                if matches_positions(word, letter, positions)
+            ]
+        else:
+            candidates = [word for word in candidates if letter not in word]
+
+        print(f"Possible words remaining: {len(candidates)}")
+
+    print()
+
+    if len(candidates) == 1:
+        print(f"My guess is: {candidates[0]}")
+    elif len(candidates) > 1:
+        print("I couldn't narrow it down to one word.")
+        print("Possible words:")
+        for word in candidates[:10]:
+            print("-", word)
+    else:
+        print("No matching word found.")
+
+