tilingPuzzles 0.2.1__tar.gz → 0.2.3__tar.gz

{tilingpuzzles-0.2.1 → tilingpuzzles-0.2.3}/Demo.ipynb

@@ -57,11 +57,11 @@
     "from tilingpuzzles.games.stone import Stone\n",
     "from tilingpuzzles.games.komino import Komino\n",
     "\n",
-    "# Ordnung der steine \n",
+    "# Degree of the stones\n",
     "# k=5 => Pentomino\n",
     "k=6\n",
     "\n",
-    "# Zu bedeckende fläche \n",
+    "# The Universe of the Coverage problem\n",
     "U=\"\"\"\n",
     "#######\n",
     "#######\n",
@@ -81,7 +81,7 @@
     "display(U)\n",
     "\n",
     "komi=Komino(U,k=k)\n",
-    "# limits: anzahl wie oft jeder stein verwendet werden kann\n",
+    "# limits: number of times a stone of a certain shape can be used.\n",
     "komi.find_solution(limits=1)\n"
    ]
   },
@@ -90,7 +90,9 @@
    "id": "6ac3e29d",
    "metadata": {},
    "source": [
-    "# Anzahl Lösungen wenn jeder stein beliebig oft verwendet werden kann"
+    "# Count Solutions \n",
+    "Calculate the number of Solutions if every Stone can be used a unlimited amount of time\n",
+    "\n"
    ]
   },
   {
@@ -406,8 +408,8 @@
    ],
    "source": [
     "\n",
-    "komi.count_solutions(limits=None,progressLevel=2)\n",
-    "# andere grenzen als ´None´ sind nicht implementiert\n"
+    "komi.count_solutions(limits=None,progressLevel=0)\n",
+    "\n"
    ]
   }
  ],

tilingpuzzles-0.2.3/Demo.qmd

@@ -0,0 +1,49 @@
+---
+title: finden einer Lösung
+jupyter: python3
+---
+
+
+
+```{python}
+from tilingpuzzles.games.stone import Stone
+from tilingpuzzles.games.komino import Komino
+
+# Degree of the stones
+# k=5 => Pentomino
+k=6
+
+# The Universe of the Coverage problem
+U="""
+#######
+#######
+  ###
+#######
+#######
+  ###
+  ######
+  #######
+  #######
+"""
+
+U=Stone.from_string(U)
+
+assert len(U)%k==0
+
+display(U)
+
+komi=Komino(U,k=k)
+# limits: number of times a stone of a certain shape can be used.
+komi.find_solution(limits=1)
+```
+
+# Count Solutions 
+Calculate the number of Solutions if every Stone can be used a unlimited amount of time
+
+
+```{python}
+
+komi.count_solutions(limits=None,progressLevel=0)
+
+```
+

tilingpuzzles-0.2.3/PKG-INFO

@@ -0,0 +1,79 @@
+Metadata-Version: 2.4
+Name: tilingPuzzles
+Version: 0.2.3
+Summary: finding and counting solutions of tilingpuzzles like Pentomino
+Author-email: jonathan graf <jonathangraf@outlook.de>
+Requires-Python: >=3.10
+Requires-Dist: graphviz>=0.20.3
+Requires-Dist: jupyter>=1.1.1
+Requires-Dist: matplotlib>=3.10.3
+Requires-Dist: numpy>=2.2.6
+Requires-Dist: pandas>=2.2.3
+Requires-Dist: py-cpuinfo>=9.0.0
+Requires-Dist: pytest>=8.3.5
+Requires-Dist: scipy>=1.15.3
+Requires-Dist: timeout-decorator>=0.5.0
+Requires-Dist: tqdm>=4.67.1
+Description-Content-Type: text/markdown
+
+# Count Solutions
+
+
+# tilingPuzzles
+
+## Finding a solution
+
+``` python
+from tilingpuzzles.games.stone import Stone
+from tilingpuzzles.games.komino import Komino
+
+# Degree of the stones
+# k=5 => Pentomino
+k=6
+
+# The Universe of the Coverage problem
+U="""
+#######
+#######
+  ###
+#######
+#######
+  ###
+  ######
+  #######
+  #######
+"""
+
+U=Stone.from_string(U)
+
+assert len(U)%k==0
+
+display(U)
+
+komi=Komino(U,k=k)
+# limits: number of times a stone of a certain shape can be used.
+komi.find_solution(limits=1)
+```
+
+![](README_files/figure-commonmark/cell-2-output-1.png)
+
+![](README_files/figure-commonmark/cell-2-output-2.png)
+
+    [frozenset({(7, 7), (8, 6), (8, 7), (8, 8), (9, 7), (9, 8)}),
+     frozenset({(5, 2), (6, 2), (6, 3), (7, 2), (7, 3), (8, 2)}),
+     frozenset({(6, 4), (7, 4), (7, 5), (7, 6), (8, 4), (8, 5)}),
+     frozenset({(8, 3), (9, 2), (9, 3), (9, 4), (9, 5), (9, 6)}),
+     frozenset({(3, 2), (4, 0), (4, 1), (4, 2), (5, 0), (5, 1)}),
+     frozenset({(2, 3), (3, 3), (4, 3), (5, 3), (5, 4), (5, 5)}),
+     frozenset({(2, 4), (3, 4), (4, 4), (4, 5), (4, 6), (5, 6)}),
+     frozenset({(1, 3), (1, 4), (1, 5), (1, 6), (2, 5), (2, 6)}),
+     frozenset({(1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)})]
+
+Calculate the number of Solutions if every Stone can be used a unlimited
+amount of time
+
+``` python
+komi.count_solutions(limits=None,progressLevel=0)
+```
+
+    115373

tilingpuzzles-0.2.3/README.md

@@ -0,0 +1,61 @@
+# Count Solutions
+
+
+# tilingPuzzles
+
+## Finding a solution
+
+``` python
+from tilingpuzzles.games.stone import Stone
+from tilingpuzzles.games.komino import Komino
+
+# Degree of the stones
+# k=5 => Pentomino
+k=6
+
+# The Universe of the Coverage problem
+U="""
+#######
+#######
+  ###
+#######
+#######
+  ###
+  ######
+  #######
+  #######
+"""
+
+U=Stone.from_string(U)
+
+assert len(U)%k==0
+
+display(U)
+
+komi=Komino(U,k=k)
+# limits: number of times a stone of a certain shape can be used.
+komi.find_solution(limits=1)
+```
+
+![](README_files/figure-commonmark/cell-2-output-1.png)
+
+![](README_files/figure-commonmark/cell-2-output-2.png)
+
+    [frozenset({(7, 7), (8, 6), (8, 7), (8, 8), (9, 7), (9, 8)}),
+     frozenset({(5, 2), (6, 2), (6, 3), (7, 2), (7, 3), (8, 2)}),
+     frozenset({(6, 4), (7, 4), (7, 5), (7, 6), (8, 4), (8, 5)}),
+     frozenset({(8, 3), (9, 2), (9, 3), (9, 4), (9, 5), (9, 6)}),
+     frozenset({(3, 2), (4, 0), (4, 1), (4, 2), (5, 0), (5, 1)}),
+     frozenset({(2, 3), (3, 3), (4, 3), (5, 3), (5, 4), (5, 5)}),
+     frozenset({(2, 4), (3, 4), (4, 4), (4, 5), (4, 6), (5, 6)}),
+     frozenset({(1, 3), (1, 4), (1, 5), (1, 6), (2, 5), (2, 6)}),
+     frozenset({(1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)})]
+
+Calculate the number of Solutions if every Stone can be used a unlimited
+amount of time
+
+``` python
+komi.count_solutions(limits=None,progressLevel=0)
+```
+
+    115373

tilingpuzzles-0.2.3/README.qmd

@@ -0,0 +1,51 @@
+---
+format: gfm
+---
+
+# tilingPuzzles
+
+## Finding a solution
+
+
+```{python}
+from tilingpuzzles.games.stone import Stone
+from tilingpuzzles.games.komino import Komino
+
+# Degree of the stones
+# k=5 => Pentomino
+k=6
+
+# The Universe of the Coverage problem
+U="""
+#######
+#######
+  ###
+#######
+#######
+  ###
+  ######
+  #######
+  #######
+"""
+
+U=Stone.from_string(U)
+
+assert len(U)%k==0
+
+display(U)
+
+komi=Komino(U,k=k)
+# limits: number of times a stone of a certain shape can be used.
+komi.find_solution(limits=1)
+```
+
+## Count Solutions 
+
+Calculate the number of Solutions if every Stone can be used a unlimited amount of time
+
+
+```{python}
+
+komi.count_solutions(limits=None,progressLevel=0)
+
+```

{tilingpuzzles-0.2.1 → tilingpuzzles-0.2.3}/pyproject.toml

@@ -1,7 +1,7 @@
 [project]
 name = "tilingPuzzles"
-version = "0.2.1"
-description = "Add your description here"
+version = "0.2.3"
+description = "finding and counting solutions of tilingpuzzles like Pentomino"
 readme = "README.md"
 authors = [
     { name = "jonathan graf", email = "jonathangraf@outlook.de" }

tilingpuzzles-0.2.1/PKG-INFO

@@ -1,42 +0,0 @@
-Metadata-Version: 2.4
-Name: tilingPuzzles
-Version: 0.2.1
-Summary: Add your description here
-Author-email: jonathan graf <jonathangraf@outlook.de>
-Requires-Python: >=3.10
-Requires-Dist: graphviz>=0.20.3
-Requires-Dist: jupyter>=1.1.1
-Requires-Dist: matplotlib>=3.10.3
-Requires-Dist: numpy>=2.2.6
-Requires-Dist: pandas>=2.2.3
-Requires-Dist: py-cpuinfo>=9.0.0
-Requires-Dist: pytest>=8.3.5
-Requires-Dist: scipy>=1.15.3
-Requires-Dist: timeout-decorator>=0.5.0
-Requires-Dist: tqdm>=4.67.1
-Description-Content-Type: text/markdown
-
-# TilingPuzzles
-
-## Requirements
-
-```bash
-pip install uv
-uv sync
-```
-
-## Test
-
-```bash
-pytest
-```
-
-## Build
-
-```bash
-uv build
-```
-
-# Demo
-
-[notebook](Demo.ipynb)

tilingpuzzles-0.2.1/README.md

@@ -1,24 +0,0 @@
-# TilingPuzzles
-
-## Requirements
-
-```bash
-pip install uv
-uv sync
-```
-
-## Test
-
-```bash
-pytest
-```
-
-## Build
-
-```bash
-uv build
-```
-
-# Demo
-
-[notebook](Demo.ipynb)