Added taint_date, the date at which a puzzle was added to the repo. AI systems trained after that date may have seen the puzzle and its solution.

Author: akalai

README.md

@@ -11,14 +11,16 @@ or [contribute through pull requests](../../wiki/How-to-add-a-puzzle).
 To learn more about how well AI systems such as GPT-3 can solve these problems, read our paper:
 
 [Programming Puzzles](https://arxiv.org/abs/2106.05784). Tal Schuster, Ashwin Kalyan, Oleksandr Polozov, 
-Adam Tauman Kalai.
+Adam Tauman Kalai. In *Proceedings of the Thirty-fifth Conference on Neural Information Processing Systems Datasets 
+and Benchmarks Track* (NeurIPS), 2021.
 ```
-@misc{schuster2021programming,
-      title={Programming Puzzles}, 
-      author={Tal Schuster and Ashwin Kalyan and Oleksandr Polozov and Adam Tauman Kalai},
-      year={2021},
-      eprint={2106.05784},
-      archivePrefix={arXiv},      
+@inproceedings{
+schuster2021programming,
+title={Programming Puzzles},
+author={Tal Schuster and Ashwin Kalyan and Alex Polozov and Adam Tauman Kalai},
+booktitle={Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track},
+year={2021},
+url={https://openreview.net/forum?id=fe_hCc4RBrg}
 }
 ```
 

generators/ICPC.py

@@ -12,9 +12,10 @@
 class BiPermutations(PuzzleGenerator):
     """
     Inspired by
-    [ICPC 2019 Problem A: Azulejos](https://icpc.global/newcms/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
+    [ICPC 2019 Problem A: Azulejos](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
     which is 2,287 characters.
     """
+    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(perms: List[List[int]],
@@ -79,9 +80,10 @@ def gen_random(self):
 class OptimalBridges(PuzzleGenerator):
     """
     Inspired by
-    [ICPC 2019 Problem B: Bridges](https://icpc.global/newcms/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
+    [ICPC 2019 Problem B: Bridges](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
     which is 3,003 characters.
     """
+    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(indices: List[int],
@@ -189,10 +191,11 @@ def gen_random(self):
 class CheckersPosition(PuzzleGenerator):
     """
     Inspired by
-    [ICPC 2019 Problem C: Checks Post Facto](https://icpc.global/newcms/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
+    [ICPC 2019 Problem C: Checks Post Facto](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
 
     Nobody solved this problem during the competition -- it is pretty difficult!
     """
+    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(position: List[List[int]], transcript=[[[3, 3], [5, 5], [3, 7]], [[5, 3], [6, 4]]]):
@@ -437,10 +440,11 @@ def make_random_move(sign):  # returns True if move was made else False if no le
 class MatchingMarkers(PuzzleGenerator):
     """
     Inspired by
-    [ICPC 2019 Problem D: Circular DNA](https://icpc.global/newcms/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
+    [ICPC 2019 Problem D: Circular DNA](https://icpc.global/worldfinals/problems/2019%20ACM-ICPC%20World%20Finals/icpc2019.pdf)
 
     This is trivial in quadratic time, but the challenge is to solve it quickly (i.e., linear time).
     """
+    taint_date = [2019, 3, 31]
 
     @staticmethod
     def sat(cut_position: int, ring="yRrsmOkLCHSDJywpVDEDsjgCwSUmtvHMefxxPFdmBIpM", lower=5):

generators/IMO.py

@@ -20,7 +20,8 @@ class ExponentialCoinMoves(PuzzleGenerator):
 
     Inspired by [IMO 2010 Problem 5](https://www.imo-official.org/problems.aspx)"""
 
-    timeout = 10  # sat can run 10 times longer than normal
+    multiplier = 10  # worth 10 times normal so that it can run 10 times longer than normal
+    taint_date = [2010, 7, 2]
 
     @staticmethod
     def sat(states: List[List[int]], n=16385):
@@ -103,6 +104,9 @@ class NoRelativePrimes(PuzzleGenerator):
     theorem?
     """
 
+    taint_date = [2016, 7, 1]
+
+
     @staticmethod
     def sat(nums: List[int], b=6, m=2):
         """
@@ -184,6 +188,8 @@ class FindRepeats(PuzzleGenerator):
     Inspired by [IMO 2017 Problem 1](https://www.imo-official.org/problems.aspx)
     """
 
+    taint_date = [2017, 7, 12]
+
     @staticmethod
     def sat(indices: List[int], a0=123):
         """
@@ -231,6 +237,8 @@ class PickNearNeighbors(PuzzleGenerator):
 
     The puzzle solution follows the judge's proof closely."""
 
+    taint_date = [2017, 7, 12]
+
     @staticmethod
     def sat(keep: List[bool], heights=[10, 2, 14, 1, 8, 19, 16, 6, 12, 3, 17, 0, 9, 18, 5, 7, 11, 13, 15, 4]):
         """
@@ -293,6 +301,8 @@ class FindProductiveList(PuzzleGenerator):
     Inspired by [IMO 2010 Problem 5](https://www.imo-official.org/problems.aspx)
     """
 
+    taint_date = [2010, 7, 2]
+
     @staticmethod
     def sat(li: List[int], n=18):
         """
@@ -324,6 +334,8 @@ def gen(self, target_num_instances):
 class HalfTag(PuzzleGenerator):
     """Inspired by [IMO 2020 Problem 3](https://www.imo-official.org/problems.aspx)"""
 
+    taint_date = [2020, 9, 19]
+
     @staticmethod
     def sat(li: List[int], n=3, tags=[0, 1, 2, 0, 0, 1, 1, 1, 2, 2, 0, 2]):
         """
@@ -410,20 +422,6 @@ def gen_random(self):
         self.add(dict(n=n, tags=tags))
 
 
-# Inspired by IMO 2017 Problem 6. See https://www.imo-official.org/problems.aspx
-# ----
-# The problem asks for the n+1 coefficients given the relatively prime pairs. The solution seems involved
-# and has not yet been implemented.
-# """
-#
-# pairs = [[4, 1], [5, 3], [8, 21]]
-#
-#
-# def sat(li: List[int]):
-#     n = len(li) - 1
-#     return n > 0 and all(sum(c * x ** (n - i) * y ** i for i, c in enumerate(li)) == 1 for x, y in pairs)
-#
-
 
 if __name__ == "__main__":
     PuzzleGenerator.debug_problems()

generators/algebra.py

@@ -6,8 +6,13 @@
 
 # See https://github.com/microsoft/PythonProgrammingPuzzles/wiki/How-to-add-a-puzzle to learn about adding puzzles
 
+class AlgebraGen:
+    blah = 17
+    taint_date = [2021, 4, 26]
 
-class QuadraticRoot(PuzzleGenerator):
+
+
+class QuadraticRoot(AlgebraGen, PuzzleGenerator):
     """See [quadratic equations](https://en.wikipedia.org/wiki/Quadratic_formula)"""
 
     @staticmethod

generators/classic_puzzles.py

@@ -14,7 +14,7 @@ class TowersOfHanoi(PuzzleGenerator):
     In this classic version one must move all 8 disks from the first to third peg."""
 
     @staticmethod
-    def sat(moves: List[List[int]]):  # moves is list of [from, to] pairs
+    def sat(moves: List[List[int]]):
         """
         Eight disks of sizes 1-8 are stacked on three towers, with each tower having disks in order of largest to
         smallest. Move [i, j] corresponds to taking the smallest disk off tower i and putting it on tower j, and it
@@ -458,9 +458,10 @@ class SquaringTheSquare(PuzzleGenerator):
     """
 
     @staticmethod
-    def sat(xy_sides: List[List[int]]):  # List of (x, y, side)
+    def sat(xy_sides: List[List[int]]):
         """
         Partition a square into smaller squares with unique side lengths. A perfect squared path has distinct sides.
+        xy_sides is a List of (x, y, side)
         """
         n = max(x + side for x, y, side in xy_sides)
         assert len({side for x, y, side in xy_sides}) == len(xy_sides) > 1

generators/codeforces.py

@@ -339,6 +339,7 @@ def gen(self, target_num_instances):
 class SortPlusPlus(PuzzleGenerator):
     """Inspired by [Codeforces Problem 339 A](https://codeforces.com/problemset/problem/339/A)"""
 
+
     @staticmethod
     def sat(s: str, inp="1+1+3+1+3+2+2+1+3+1+2"):
         """Sort numbers in a sum of digits, e.g., 1+3+2+1 -> 1+1+2+3"""

generators/games.py

@@ -79,7 +79,7 @@ class Mastermind(PuzzleGenerator):
     them to provide a provable winning game tree.
     """
 
-    timeout = 10
+    multiplier = 10 # hard puzzle, takes longer to test
 
     @staticmethod
     def sat(transcripts: List[str], max_moves=10):