Started adding tags

Author: akalai

generators/ICPC.py

@@ -2,7 +2,7 @@
 Problems inspired by the [International Collegiate Programming Contest](https://icpc.global) (ICPC).
 """
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 

generators/IMO.py

@@ -2,7 +2,7 @@
 [International Mathematical Olympiad](https://en.wikipedia.org/wiki/International_Mathematical_Olympiad)
 [problems](https://www.imo-official.org/problems.aspx)"""
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 

generators/algebra.py

@@ -1,6 +1,6 @@
 """Roots of polynomials"""
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 
@@ -10,6 +10,8 @@
 class QuadraticRoot(PuzzleGenerator):
     """See [quadratic equations](https://en.wikipedia.org/wiki/Quadratic_formula)"""
 
+    tags = [Tags.math, Tags.famous]
+
     @staticmethod
     def sat(x: float, coeffs=[2.5, 1.3, -0.5]):
         """
@@ -47,6 +49,8 @@ def gen_random(self):
 class AllQuadraticRoots(PuzzleGenerator):
     """See [quadratic equations](https://en.wikipedia.org/wiki/Quadratic_formula)."""
 
+    tags = [Tags.math, Tags.famous]
+
     @staticmethod
     def sat(roots: List[float], coeffs=[1.3, -0.5]):
         """Find all (real) solutions to: x^2 + b x + c (i.e., factor into roots), here coeffs = [b, c]"""
@@ -70,6 +74,8 @@ def gen_random(self):
 class CubicRoot(PuzzleGenerator):
     """See [cubic equation](https://en.wikipedia.org/wiki/Cubic_formula)."""
 
+    tags = [Tags.math, Tags.famous]
+
     @staticmethod
     def sat(x: float, coeffs=[2.0, 1.0, 0.0, 8.0]):
         """
@@ -104,6 +110,8 @@ def gen_random(self):
 class AllCubicRoots(PuzzleGenerator):
     """See [cubic equation](https://en.wikipedia.org/wiki/Cubic_formula)."""
 
+    tags = [Tags.math, Tags.famous]
+
     @staticmethod
     def sat(roots: List[float], coeffs=[1.0, -2.0, -1.0]):
         """Find all 3 distinct real roots of x^3 + a x^2 + b x + c, i.e., factor into (x-r1)(x-r2)(x-r3).

generators/basic.py

@@ -1,12 +1,15 @@
 """Problems testing basic knowledge -- easy to solve if you understand what is being asked"""
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 
 # See https://github.com/microsoft/PythonProgrammingPuzzles/wiki/How-to-add-a-puzzle to learn about adding puzzles
 
 class SumOfDigits(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(x: str, s=679):
         """Find a number that its digits sum to a specific value."""
@@ -22,6 +25,9 @@ def gen_random(self):
 
 
 class FloatWithDecimalValue(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(z: float, v=9, d=0.0001):
         """Create a float with a specific decimal."""
@@ -44,6 +50,9 @@ def gen_random(self):
 
 
 class ArithmeticSequence(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(x: List[int], a=7, s=5, e=200):
         """Create a list that is a subrange of an arithmetic sequence."""
@@ -61,6 +70,9 @@ def gen_random(self):
 
 
 class GeometricSequence(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(x: List[int], a=8, r=2, l=50):
         """Create a list that is a subrange of an gemoetric sequence."""
@@ -78,6 +90,9 @@ def gen_random(self):
 
 
 class LineIntersection(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(e: List[int], a=2, b=-1, c=1, d=2021):
         """
@@ -103,6 +118,9 @@ def gen_random(self):
 
 
 class IfProblem(PuzzleGenerator):
+
+    tags = [Tags.trivial]
+
     @staticmethod
     def sat(x: int, a=324554, b=1345345):
         """Satisfy a simple if statement"""
@@ -125,6 +143,9 @@ def gen_random(self):
 
 
 class IfProblemWithAnd(PuzzleGenerator):
+
+    tags = [Tags.trivial]
+
     @staticmethod
     def sat(x: int, a=9384594, b=1343663):
         """Satisfy a simple if statement with an and clause"""
@@ -148,6 +169,8 @@ def gen_random(self):
 
 class IfProblemWithOr(PuzzleGenerator):
 
+    tags = [Tags.trivial]
+
     @staticmethod
     def sat(x: int, a=253532, b=1230200):
         """Satisfy a simple if statement with an or clause"""
@@ -171,6 +194,8 @@ def gen_random(self):
 
 class IfCases(PuzzleGenerator):
 
+    tags = [Tags.trivial]
+
     @staticmethod
     def sat(x: int, a=4, b=54368639):
         """Satisfy a simple if statement with multiple cases"""
@@ -198,6 +223,9 @@ def gen_random(self):
 
 
 class ListPosSum(PuzzleGenerator):
+
+    tags = [Tags.trivial]
+
     @staticmethod
     def sat(x: List[int], n=5, s=19):
         """Find a list of n non-negative integers that sum up to s"""
@@ -216,6 +244,9 @@ def gen_random(self):
 
 
 class ListDistinctSum(PuzzleGenerator):
+
+    tags = [Tags.math]
+
     @staticmethod
     def sat(x: List[int], n=4, s=2021):
         """Construct a list of n distinct integers that sum up to s"""
@@ -244,6 +275,9 @@ def gen_random(self):
 
 
 class ConcatStrings(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(x: str, s=["a", "b", "c", "d", "e", "f"], n=4):
         """Concatenate the list of characters in s"""
@@ -262,6 +296,8 @@ def gen_random(self):
 
 class SublistSum(PuzzleGenerator):
 
+    tags = [Tags.math]
+
     @staticmethod
     def sat(x: List[int], t=677, a=43, e=125, s=10):
         """Sum values of sublist by range specifications"""
@@ -292,6 +328,8 @@ def gen_random(self):
 
 class CumulativeSum(PuzzleGenerator):
 
+    tags = [Tags.math, Tags.trivial]
+
     @staticmethod
     def sat(x: List[int], t=50, n=10):
         """Find how many values have cumulative sum less than target"""
@@ -316,6 +354,9 @@ def gen_random(self):
 
 
 class BasicStrCounts(PuzzleGenerator):
+
+    tags = [Tags.strings]
+
     @staticmethod
     def sat(s: str, s1='a', s2='b', count1=50, count2=30):
         """
@@ -347,6 +388,9 @@ def gen_random(self):
 
 
 class ZipStr(PuzzleGenerator):
+
+    tags = [Tags.strings, Tags.trivial]
+
     @staticmethod
     def sat(s: str, substrings=["foo", "bar", "baz", "oddball"]):
         """
@@ -365,6 +409,9 @@ def gen_random(self):
 
 
 class ReverseCat(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(s: str, substrings=["foo", "bar", "baz"]):
         """
@@ -382,6 +429,9 @@ def gen_random(self):
 
 
 class EngineerNumbers(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(ls: List[str], n=100, a='bar', b='foo'):
         """
@@ -401,6 +451,9 @@ def gen_random(self):
 
 
 class PenultimateString(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(s: str, strings=["cat", "dog", "bird", "fly", "moose"]):
         """Find the alphabetically second to last last string in a list."""
@@ -417,6 +470,9 @@ def gen_random(self):
 
 
 class PenultimateRevString(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(s: str, strings=["cat", "dog", "bird", "fly", "moose"]):
         """Find the reversed version of the alphabetically second string in a list."""
@@ -433,6 +489,9 @@ def gen_random(self):
 
 
 class CenteredString(PuzzleGenerator):
+
+    tags = [Tags.trivial, Tags.strings]
+
     @staticmethod
     def sat(s: str, target="foobarbazwow", length=6):
         """Find a substring of the given length centered within the target string."""
@@ -449,6 +508,9 @@ def gen_random(self):
 
 
 class SubstrCount(PuzzleGenerator):
+
+    tags = [Tags.brute_force, Tags.strings]
+
     @staticmethod
     def sat(substring: str, string="moooboooofasd", count=2):
         """Find a substring with a certain count in a given string"""
@@ -478,6 +540,9 @@ def gen_random(self):
 
 
 class CompleteParens(PuzzleGenerator):
+
+    tags = []
+
     @staticmethod
     def sat(t: str, s="))(Add)some))parens()to()(balance(()(()(me!)(((("):
         """Add parentheses to the beginning and end of s to make all parentheses balanced"""

generators/chess.py

@@ -1,6 +1,6 @@
 """Classic chess puzzles"""
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 
@@ -18,6 +18,8 @@ class EightQueensOrFewer(PuzzleGenerator):
     Hint: a brute force approach works on this puzzle.
     """
 
+    tags = [Tags.games, Tags.brute_force, Tags.famous]
+
     @staticmethod
     def sat(squares: List[List[int]], m=8, n=8):
         """Position min(m, n) <= 8 queens on an m x n chess board so that no pair is attacking each other."""
@@ -49,6 +51,8 @@ class MoreQueens(PuzzleGenerator):
     A brute force approach will not work on many of these problems.
     """
 
+    tags = [Tags.games, Tags.graphs, Tags.famous]
+
     @staticmethod
     def sat(squares: List[List[int]], m=9, n=9):
         """
@@ -89,6 +93,8 @@ class KnightsTour(PuzzleGenerator):
     See Wikipedia entry on [Knight's tour](https://en.wikipedia.org/w/index.php?title=Knight%27s_tour)
     """
 
+    tags = [Tags.games, Tags.graphs, Tags.hard, Tags.famous]
+
     @staticmethod
     def sat(tour: List[List[int]], m=8, n=8):
         """Find an (open) tour of knight moves on an m x n chess-board that visits each square once."""
@@ -140,6 +146,8 @@ class UncrossedKnightsPath(PuzzleGenerator):
     A more precise description is in this
     [Wikipedia article](https://en.wikipedia.org/w/index.php?title=Longest_uncrossed_knight%27s_path)."""
 
+    tags = [Tags.games, Tags.hard, Tags.famous]
+
     nxn_records = {3: 2, 4: 5, 5: 10, 6: 17, 7: 24, 8: 35, 9: 47, 10: 61, 11: 76, 12: 94, 13: 113, 14: 135, 15: 158,
                    16: 183, 17: 211, 18: 238, 19: 268, 20: 302, 21: 337, 22: 375, 23: 414}
 
@@ -192,6 +200,8 @@ class UNSOLVED_UncrossedKnightsPath(PuzzleGenerator):
     A more precise description is in this
     [Wikipedia article](https://en.wikipedia.org/w/index.php?title=Longest_uncrossed_knight%27s_path)."""
 
+    tags = [Tags.unsolved, Tags.games, Tags.famous]
+
     unsolved_nxn_records = {10: 61, 11: 76, 12: 94, 13: 113, 14: 135, 15: 158,
                             16: 183, 17: 211, 18: 238, 19: 268, 20: 302, 21: 337, 22: 375, 23: 414}
 

generators/classic_puzzles.py

@@ -1,6 +1,7 @@
 """Classic puzzles"""
+# TODO: add tags
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List
 
 
@@ -938,6 +939,7 @@ def sat(li: List[int], words=["SEND", "MORE", "MONEY"]):
 
     @staticmethod
     def sol(words):
+        print("solving", words)
         pi = list(range(10))  # permutation
         letters = []
         order = {}

generators/codeforces.py

@@ -1,6 +1,7 @@
 """Problems inspired by the popular programming competition site [codeforces.com](https://codeforces.com)"""
+# TODO: add tags
 
-from puzzle_generator import PuzzleGenerator
+from puzzle_generator import PuzzleGenerator, Tags
 from typing import List