multi-puzzle-solver 0.8.7__tar.gz → 0.9.0__tar.gz

{multi_puzzle_solver-0.8.7 → multi_puzzle_solver-0.9.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: multi-puzzle-solver
-Version: 0.8.7
+Version: 0.9.0
 Summary: Efficient solvers for numerous popular and esoteric logic puzzles using CP-SAT
 Author: Ar-Kareem
 Project-URL: Homepage, https://github.com/Ar-Kareem/puzzle_solver
@@ -210,8 +210,14 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
       <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_range_unsolved.png" alt="Chess range" height="120">
     </a>
   </td>
+  <td align="center">
+    <a href="#chess-solo-puzzle-type-24"><b>Chess Solo</b><br><br>
+      <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo" height="120">
+    </a>
+  </td>
+  <td align="center">
   
-  </td><td></td><td></td>
+  </td>
 </tr>
 </table>
 
@@ -249,9 +255,10 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
   - [Bridges (Puzzle Type #20)](#bridges-puzzle-type-20)
   - [Inertia (Puzzle Type #21)](#inertia-puzzle-type-21)
   - [Guess (Puzzle Type #22)](#guess-puzzle-type-22)
-  - [Chess Range(Puzzle Type #23)](#chess-rangepuzzle-type-23)
+  - [Chess Range (Puzzle Type #23)](#chess-range-puzzle-type-23)
+  - [Chess Solo (Puzzle Type #24)](#chess-solo-puzzle-type-24)
+  - [Chess Melee (Puzzle Type #25)](#chess-melee-puzzle-type-25)
   - [Why SAT / CP-SAT?](#why-sat--cp-sat)
-  - [What’s Inside](#whats-inside)
   - [Testing](#testing)
   - [Contributing](#contributing)
     - [Build and push to PyPI](#build-and-push-to-pypi)
@@ -1935,7 +1942,7 @@ In the case when there's only one possible choice left, the solver will inform y
 
 ---
 
-## Chess Range(Puzzle Type #23)
+## Chess Range (Puzzle Type #23)
 
 * [**Play online**](https://www.puzzle-chess.com/chess-ranger-11/)
 
@@ -1944,7 +1951,7 @@ In the case when there's only one possible choice left, the solver will inform y
 <details>
   <summary><strong>Rules</strong></summary>
 
-You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ range of moves where each move is a legal chess move and captures another piece.
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece.
 
 - Pieces move as standard chess pieces.
 - You can perform only capture moves. A move that does not capture another piece is not allowed.
@@ -1977,7 +1984,7 @@ Solution found
 ['Rg2->Pc2', 'Rc2->Bc3', 'Rc3->Pd3', 'Kb6->Pb5', 'Pg4->Nf5', 'Rd3->Rb3', 'Rb3->Kb5', 'Nc6->Qe7', 'Ne7->Pf5', 'Rb5->Nf5']
 Solutions found: 1
 status: FEASIBLE
-Time taken: 6.27 seconds
+Time taken: 1.16 seconds
 ```
 
 **Solved puzzle**
@@ -1986,6 +1993,108 @@ Time taken: 6.27 seconds
 
 ---
 
+## Chess Solo (Puzzle Type #24)
+
+* [**Play online**](https://www.puzzle-chess.com/solo-chess-11/)
+
+* [**Solver Code**][24]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece and end up with the king as the only piece on the board. You are not allowed to move a piece more than twice.
+
+- Pieces move as standard chess pieces.
+- You can perform only capture moves. A move that does not capture another piece is not allowed.
+- You can move a piece only twice.
+- You are NOT allowed to capture the king.
+- The goal is to end up with one single piece (the king) on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Kc6', 'Rc5', 'Rc4', 'Pb3', 'Bd3', 'Pd2', 'Pe3', 'Nf2', 'Ng2', 'Qg3', 'Pg6']
+binst = solver.Board(board)
+solutions = binst.solve_and_print(max_solutions=1)
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Qg3->Pg6', 'Qg6->Bd3', 'Pd2->Pe3', 'Ng2->Pe3', 'Nf2->Qd3', 'Ne3->Rc4', 'Pb3->Nc4', 'Nd3->Rc5', 'Kc6->Nc5', 'Kc5->Pc4']
+Solutions found: 1
+status: FEASIBLE
+Time taken: 0.47 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_solved.png" alt="Chess solo solved" width="500">
+
+---
+
+## Chess Melee (Puzzle Type #25)
+
+* [**Play online**](https://www.puzzle-chess.com/chess-melee-13/)
+
+* [**Solver Code**][25]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it (equal white and black pieces, one more black if $N$ is odd). Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece of the opposite color and end up with a single piece on the board. White starts and colors alternate as usual.
+
+- Pieces move as standard chess pieces.
+- White moves first.
+- You can perform only capture moves. A move that does not capture another piece of the opposite color is not allowed.
+- The goal is to end up with one single piece on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_unsolved.png" alt="Chess melee unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Pb7', 'Nc7', 'Bc6', 'Ne6', 'Pb5', 'Rc4', 'Qb3', 'Rf7', 'Rb6', 'Pe5', 'Nc3', 'Pd3', 'Nf3']
+colors = ['B', 'B', 'B', 'B', 'B', 'B', 'B', 'W', 'W', 'W', 'W', 'W', 'W']
+binst = solver.Board(board, colors)
+solutions = binst.solve_and_print()
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Rf7->Nc7', 'Ne6->Rc7', 'Pd3->Rc4', 'Qb3->Nc3', 'Pc4->Pb5', 'Qc3->Pe5', 'Nf3->Qe5', 'Nc7->Pb5', 'Ne5->Bc6', 'Pb7->Nc6', 'Rb6->Nb5', 'Pc6->Rb5']
+Solutions found: 1
+status: OPTIMAL
+Time taken: 6.24 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_solved.png" alt="Chess melee solved" width="500">
+
+---
+
 ---
 
 ## Why SAT / CP-SAT?
@@ -2000,36 +2109,6 @@ This repo builds those constraints in Python and uses SAT/CP-SAT (e.g., OR-Tools
 
 ---
 
-## What’s Inside
-
-Each sub directory in `src/puzzle_solver/puzzles/` targets a different puzzle type. The following are the sub directories:
-
-* `nonograms` — Picross/Griddlers (run-length constraints). ([Chapter 10][1])
-* `sudoku` — Sudoku (rows/cols/blocks all-different). ([Chapter 11][2])
-* `minesweeper` — Minesweeper (mines + counts). ([Chapter 12][3])
-* `guess` — Guess (similar to wordle, guess the colored circles). ([Chapter 15][22])
-* `dominosa` — Dominosa (dominoes + counts). ([Chapter 17][4])
-* `light_up` — *Akari* / Light Up (lighting & adjacency). ([Chapter 21][5])
-* `map` — Map (region coloring). ([Chapter 22][18])
-* `inertia` — Inertia (collect all gems without dying (with least number of moves; my addition)). ([Chapter 24][21])
-* `tents` — Tents (tree-tent matching). ([Chapter 25][6])
-* `bridges` — Bridges (island connections). ([Chapter 26][20])
-* `filling` — Filling (Fillomino-style), region sizes. ([Chapter 29][7])
-* `keen` — Keen (arithmetic operations). ([Chapter 30][8])
-* `towers` — Skyscrapers (permutation + visibility). ([Chapter 31][9])
-* `singles` — Singles (hiding numbers). ([Chapter 32][10])
-* `magnets` — Magnets (polarized dominoes + counts). ([Chapter 33][11])
-* `signpost` — Signpost (visible dominoes + counts). ([Chapter 34][12])
-* `range` — Range (rays & totals). ([Chapter 35][13])
-* `pearl` — Pearl (pearl game). ([Chapter 36][19])
-* `undead` — UnDead (Vampires/Zombies/Ghosts). ([Chapter 37][14])
-* `unruly` — Unruly (no triples + balance). ([Chapter 38][15])
-* `tracks` — Tracks (connected components). ([Chapter 40][16])
-* `mosaic` — Mosaic (Tapa-like tiling). ([Chapter 42][17])
-* `chess_range` — Chess Range (chess moves). ([Puzzle-Chess][23])
-
----
-
 ## Testing
 
 To run the tests, simply run the following (to create a fresh conda environment and install the dev dependencies):
@@ -2090,3 +2169,4 @@ Issues and PRs welcome!
 [16]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/tracks "puzzle_solver/src/puzzle_solver/puzzles/tracks at master · Ar-Kareem/puzzle_solver · GitHub"
 [17]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/mosaic "puzzle_solver/src/puzzle_solver/puzzles/mosaic at master · Ar-Kareem/puzzle_solver · GitHub"
 [23]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"
+[24]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range#chess-solo-puzzle-type-24 "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"

{multi_puzzle_solver-0.8.7 → multi_puzzle_solver-0.9.0}/README.md

@@ -184,8 +184,14 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
       <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_range_unsolved.png" alt="Chess range" height="120">
     </a>
   </td>
+  <td align="center">
+    <a href="#chess-solo-puzzle-type-24"><b>Chess Solo</b><br><br>
+      <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo" height="120">
+    </a>
+  </td>
+  <td align="center">
   
-  </td><td></td><td></td>
+  </td>
 </tr>
 </table>
 
@@ -223,9 +229,10 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
   - [Bridges (Puzzle Type #20)](#bridges-puzzle-type-20)
   - [Inertia (Puzzle Type #21)](#inertia-puzzle-type-21)
   - [Guess (Puzzle Type #22)](#guess-puzzle-type-22)
-  - [Chess Range(Puzzle Type #23)](#chess-rangepuzzle-type-23)
+  - [Chess Range (Puzzle Type #23)](#chess-range-puzzle-type-23)
+  - [Chess Solo (Puzzle Type #24)](#chess-solo-puzzle-type-24)
+  - [Chess Melee (Puzzle Type #25)](#chess-melee-puzzle-type-25)
   - [Why SAT / CP-SAT?](#why-sat--cp-sat)
-  - [What’s Inside](#whats-inside)
   - [Testing](#testing)
   - [Contributing](#contributing)
     - [Build and push to PyPI](#build-and-push-to-pypi)
@@ -1909,7 +1916,7 @@ In the case when there's only one possible choice left, the solver will inform y
 
 ---
 
-## Chess Range(Puzzle Type #23)
+## Chess Range (Puzzle Type #23)
 
 * [**Play online**](https://www.puzzle-chess.com/chess-ranger-11/)
 
@@ -1918,7 +1925,7 @@ In the case when there's only one possible choice left, the solver will inform y
 <details>
   <summary><strong>Rules</strong></summary>
 
-You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ range of moves where each move is a legal chess move and captures another piece.
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece.
 
 - Pieces move as standard chess pieces.
 - You can perform only capture moves. A move that does not capture another piece is not allowed.
@@ -1951,7 +1958,7 @@ Solution found
 ['Rg2->Pc2', 'Rc2->Bc3', 'Rc3->Pd3', 'Kb6->Pb5', 'Pg4->Nf5', 'Rd3->Rb3', 'Rb3->Kb5', 'Nc6->Qe7', 'Ne7->Pf5', 'Rb5->Nf5']
 Solutions found: 1
 status: FEASIBLE
-Time taken: 6.27 seconds
+Time taken: 1.16 seconds
 ```
 
 **Solved puzzle**
@@ -1960,6 +1967,108 @@ Time taken: 6.27 seconds
 
 ---
 
+## Chess Solo (Puzzle Type #24)
+
+* [**Play online**](https://www.puzzle-chess.com/solo-chess-11/)
+
+* [**Solver Code**][24]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece and end up with the king as the only piece on the board. You are not allowed to move a piece more than twice.
+
+- Pieces move as standard chess pieces.
+- You can perform only capture moves. A move that does not capture another piece is not allowed.
+- You can move a piece only twice.
+- You are NOT allowed to capture the king.
+- The goal is to end up with one single piece (the king) on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Kc6', 'Rc5', 'Rc4', 'Pb3', 'Bd3', 'Pd2', 'Pe3', 'Nf2', 'Ng2', 'Qg3', 'Pg6']
+binst = solver.Board(board)
+solutions = binst.solve_and_print(max_solutions=1)
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Qg3->Pg6', 'Qg6->Bd3', 'Pd2->Pe3', 'Ng2->Pe3', 'Nf2->Qd3', 'Ne3->Rc4', 'Pb3->Nc4', 'Nd3->Rc5', 'Kc6->Nc5', 'Kc5->Pc4']
+Solutions found: 1
+status: FEASIBLE
+Time taken: 0.47 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_solved.png" alt="Chess solo solved" width="500">
+
+---
+
+## Chess Melee (Puzzle Type #25)
+
+* [**Play online**](https://www.puzzle-chess.com/chess-melee-13/)
+
+* [**Solver Code**][25]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it (equal white and black pieces, one more black if $N$ is odd). Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece of the opposite color and end up with a single piece on the board. White starts and colors alternate as usual.
+
+- Pieces move as standard chess pieces.
+- White moves first.
+- You can perform only capture moves. A move that does not capture another piece of the opposite color is not allowed.
+- The goal is to end up with one single piece on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_unsolved.png" alt="Chess melee unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Pb7', 'Nc7', 'Bc6', 'Ne6', 'Pb5', 'Rc4', 'Qb3', 'Rf7', 'Rb6', 'Pe5', 'Nc3', 'Pd3', 'Nf3']
+colors = ['B', 'B', 'B', 'B', 'B', 'B', 'B', 'W', 'W', 'W', 'W', 'W', 'W']
+binst = solver.Board(board, colors)
+solutions = binst.solve_and_print()
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Rf7->Nc7', 'Ne6->Rc7', 'Pd3->Rc4', 'Qb3->Nc3', 'Pc4->Pb5', 'Qc3->Pe5', 'Nf3->Qe5', 'Nc7->Pb5', 'Ne5->Bc6', 'Pb7->Nc6', 'Rb6->Nb5', 'Pc6->Rb5']
+Solutions found: 1
+status: OPTIMAL
+Time taken: 6.24 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_solved.png" alt="Chess melee solved" width="500">
+
+---
+
 ---
 
 ## Why SAT / CP-SAT?
@@ -1974,36 +2083,6 @@ This repo builds those constraints in Python and uses SAT/CP-SAT (e.g., OR-Tools
 
 ---
 
-## What’s Inside
-
-Each sub directory in `src/puzzle_solver/puzzles/` targets a different puzzle type. The following are the sub directories:
-
-* `nonograms` — Picross/Griddlers (run-length constraints). ([Chapter 10][1])
-* `sudoku` — Sudoku (rows/cols/blocks all-different). ([Chapter 11][2])
-* `minesweeper` — Minesweeper (mines + counts). ([Chapter 12][3])
-* `guess` — Guess (similar to wordle, guess the colored circles). ([Chapter 15][22])
-* `dominosa` — Dominosa (dominoes + counts). ([Chapter 17][4])
-* `light_up` — *Akari* / Light Up (lighting & adjacency). ([Chapter 21][5])
-* `map` — Map (region coloring). ([Chapter 22][18])
-* `inertia` — Inertia (collect all gems without dying (with least number of moves; my addition)). ([Chapter 24][21])
-* `tents` — Tents (tree-tent matching). ([Chapter 25][6])
-* `bridges` — Bridges (island connections). ([Chapter 26][20])
-* `filling` — Filling (Fillomino-style), region sizes. ([Chapter 29][7])
-* `keen` — Keen (arithmetic operations). ([Chapter 30][8])
-* `towers` — Skyscrapers (permutation + visibility). ([Chapter 31][9])
-* `singles` — Singles (hiding numbers). ([Chapter 32][10])
-* `magnets` — Magnets (polarized dominoes + counts). ([Chapter 33][11])
-* `signpost` — Signpost (visible dominoes + counts). ([Chapter 34][12])
-* `range` — Range (rays & totals). ([Chapter 35][13])
-* `pearl` — Pearl (pearl game). ([Chapter 36][19])
-* `undead` — UnDead (Vampires/Zombies/Ghosts). ([Chapter 37][14])
-* `unruly` — Unruly (no triples + balance). ([Chapter 38][15])
-* `tracks` — Tracks (connected components). ([Chapter 40][16])
-* `mosaic` — Mosaic (Tapa-like tiling). ([Chapter 42][17])
-* `chess_range` — Chess Range (chess moves). ([Puzzle-Chess][23])
-
----
-
 ## Testing
 
 To run the tests, simply run the following (to create a fresh conda environment and install the dev dependencies):
@@ -2063,4 +2142,5 @@ Issues and PRs welcome!
 [15]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/unruly "puzzle_solver/src/puzzle_solver/puzzles/unruly at master · Ar-Kareem/puzzle_solver · GitHub"
 [16]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/tracks "puzzle_solver/src/puzzle_solver/puzzles/tracks at master · Ar-Kareem/puzzle_solver · GitHub"
 [17]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/mosaic "puzzle_solver/src/puzzle_solver/puzzles/mosaic at master · Ar-Kareem/puzzle_solver · GitHub"
-[23]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"
+[23]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"
+[24]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range#chess-solo-puzzle-type-24 "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"

{multi_puzzle_solver-0.8.7 → multi_puzzle_solver-0.9.0}/src/multi_puzzle_solver.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: multi-puzzle-solver
-Version: 0.8.7
+Version: 0.9.0
 Summary: Efficient solvers for numerous popular and esoteric logic puzzles using CP-SAT
 Author: Ar-Kareem
 Project-URL: Homepage, https://github.com/Ar-Kareem/puzzle_solver
@@ -210,8 +210,14 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
       <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_range_unsolved.png" alt="Chess range" height="120">
     </a>
   </td>
+  <td align="center">
+    <a href="#chess-solo-puzzle-type-24"><b>Chess Solo</b><br><br>
+      <img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo" height="120">
+    </a>
+  </td>
+  <td align="center">
   
-  </td><td></td><td></td>
+  </td>
 </tr>
 </table>
 
@@ -249,9 +255,10 @@ These are all the puzzles that are implemented in this repo. <br> Click on any o
   - [Bridges (Puzzle Type #20)](#bridges-puzzle-type-20)
   - [Inertia (Puzzle Type #21)](#inertia-puzzle-type-21)
   - [Guess (Puzzle Type #22)](#guess-puzzle-type-22)
-  - [Chess Range(Puzzle Type #23)](#chess-rangepuzzle-type-23)
+  - [Chess Range (Puzzle Type #23)](#chess-range-puzzle-type-23)
+  - [Chess Solo (Puzzle Type #24)](#chess-solo-puzzle-type-24)
+  - [Chess Melee (Puzzle Type #25)](#chess-melee-puzzle-type-25)
   - [Why SAT / CP-SAT?](#why-sat--cp-sat)
-  - [What’s Inside](#whats-inside)
   - [Testing](#testing)
   - [Contributing](#contributing)
     - [Build and push to PyPI](#build-and-push-to-pypi)
@@ -1935,7 +1942,7 @@ In the case when there's only one possible choice left, the solver will inform y
 
 ---
 
-## Chess Range(Puzzle Type #23)
+## Chess Range (Puzzle Type #23)
 
 * [**Play online**](https://www.puzzle-chess.com/chess-ranger-11/)
 
@@ -1944,7 +1951,7 @@ In the case when there's only one possible choice left, the solver will inform y
 <details>
   <summary><strong>Rules</strong></summary>
 
-You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ range of moves where each move is a legal chess move and captures another piece.
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece.
 
 - Pieces move as standard chess pieces.
 - You can perform only capture moves. A move that does not capture another piece is not allowed.
@@ -1977,7 +1984,7 @@ Solution found
 ['Rg2->Pc2', 'Rc2->Bc3', 'Rc3->Pd3', 'Kb6->Pb5', 'Pg4->Nf5', 'Rd3->Rb3', 'Rb3->Kb5', 'Nc6->Qe7', 'Ne7->Pf5', 'Rb5->Nf5']
 Solutions found: 1
 status: FEASIBLE
-Time taken: 6.27 seconds
+Time taken: 1.16 seconds
 ```
 
 **Solved puzzle**
@@ -1986,6 +1993,108 @@ Time taken: 6.27 seconds
 
 ---
 
+## Chess Solo (Puzzle Type #24)
+
+* [**Play online**](https://www.puzzle-chess.com/solo-chess-11/)
+
+* [**Solver Code**][24]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it. Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece and end up with the king as the only piece on the board. You are not allowed to move a piece more than twice.
+
+- Pieces move as standard chess pieces.
+- You can perform only capture moves. A move that does not capture another piece is not allowed.
+- You can move a piece only twice.
+- You are NOT allowed to capture the king.
+- The goal is to end up with one single piece (the king) on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_unsolved.png" alt="Chess solo unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Kc6', 'Rc5', 'Rc4', 'Pb3', 'Bd3', 'Pd2', 'Pe3', 'Nf2', 'Ng2', 'Qg3', 'Pg6']
+binst = solver.Board(board)
+solutions = binst.solve_and_print(max_solutions=1)
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Qg3->Pg6', 'Qg6->Bd3', 'Pd2->Pe3', 'Ng2->Pe3', 'Nf2->Qd3', 'Ne3->Rc4', 'Pb3->Nc4', 'Nd3->Rc5', 'Kc6->Nc5', 'Kc5->Pc4']
+Solutions found: 1
+status: FEASIBLE
+Time taken: 0.47 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_solo_solved.png" alt="Chess solo solved" width="500">
+
+---
+
+## Chess Melee (Puzzle Type #25)
+
+* [**Play online**](https://www.puzzle-chess.com/chess-melee-13/)
+
+* [**Solver Code**][25]
+
+<details>
+  <summary><strong>Rules</strong></summary>
+
+You are given a chess board with $N$ pieces distributed on it (equal white and black pieces, one more black if $N$ is odd). Your aim is to make $N-1$ sequence of moves where each move is a legal chess move and captures another piece of the opposite color and end up with a single piece on the board. White starts and colors alternate as usual.
+
+- Pieces move as standard chess pieces.
+- White moves first.
+- You can perform only capture moves. A move that does not capture another piece of the opposite color is not allowed.
+- The goal is to end up with one single piece on the board. 
+
+</details>
+
+**Unsolved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_unsolved.png" alt="Chess melee unsolved" width="500">
+
+Code to utilize this package and solve the puzzle:
+
+(Note that this puzzle does not typically have a unique solution. Thus, we specify here that we only want the first valid solution that the solver finds.)
+
+```python
+# algebraic notation
+board = ['Pb7', 'Nc7', 'Bc6', 'Ne6', 'Pb5', 'Rc4', 'Qb3', 'Rf7', 'Rb6', 'Pe5', 'Nc3', 'Pd3', 'Nf3']
+colors = ['B', 'B', 'B', 'B', 'B', 'B', 'B', 'W', 'W', 'W', 'W', 'W', 'W']
+binst = solver.Board(board, colors)
+solutions = binst.solve_and_print()
+```
+**Script Output**
+
+The output is in the form of "pos -> pos" where "pos" is the algebraic notation of the position.
+
+```python
+Solution found
+['Rf7->Nc7', 'Ne6->Rc7', 'Pd3->Rc4', 'Qb3->Nc3', 'Pc4->Pb5', 'Qc3->Pe5', 'Nf3->Qe5', 'Nc7->Pb5', 'Ne5->Bc6', 'Pb7->Nc6', 'Rb6->Nb5', 'Pc6->Rb5']
+Solutions found: 1
+status: OPTIMAL
+Time taken: 6.24 seconds
+```
+
+**Solved puzzle**
+
+<img src="https://raw.githubusercontent.com/Ar-Kareem/puzzle_solver/master/images/chess_melee_solved.png" alt="Chess melee solved" width="500">
+
+---
+
 ---
 
 ## Why SAT / CP-SAT?
@@ -2000,36 +2109,6 @@ This repo builds those constraints in Python and uses SAT/CP-SAT (e.g., OR-Tools
 
 ---
 
-## What’s Inside
-
-Each sub directory in `src/puzzle_solver/puzzles/` targets a different puzzle type. The following are the sub directories:
-
-* `nonograms` — Picross/Griddlers (run-length constraints). ([Chapter 10][1])
-* `sudoku` — Sudoku (rows/cols/blocks all-different). ([Chapter 11][2])
-* `minesweeper` — Minesweeper (mines + counts). ([Chapter 12][3])
-* `guess` — Guess (similar to wordle, guess the colored circles). ([Chapter 15][22])
-* `dominosa` — Dominosa (dominoes + counts). ([Chapter 17][4])
-* `light_up` — *Akari* / Light Up (lighting & adjacency). ([Chapter 21][5])
-* `map` — Map (region coloring). ([Chapter 22][18])
-* `inertia` — Inertia (collect all gems without dying (with least number of moves; my addition)). ([Chapter 24][21])
-* `tents` — Tents (tree-tent matching). ([Chapter 25][6])
-* `bridges` — Bridges (island connections). ([Chapter 26][20])
-* `filling` — Filling (Fillomino-style), region sizes. ([Chapter 29][7])
-* `keen` — Keen (arithmetic operations). ([Chapter 30][8])
-* `towers` — Skyscrapers (permutation + visibility). ([Chapter 31][9])
-* `singles` — Singles (hiding numbers). ([Chapter 32][10])
-* `magnets` — Magnets (polarized dominoes + counts). ([Chapter 33][11])
-* `signpost` — Signpost (visible dominoes + counts). ([Chapter 34][12])
-* `range` — Range (rays & totals). ([Chapter 35][13])
-* `pearl` — Pearl (pearl game). ([Chapter 36][19])
-* `undead` — UnDead (Vampires/Zombies/Ghosts). ([Chapter 37][14])
-* `unruly` — Unruly (no triples + balance). ([Chapter 38][15])
-* `tracks` — Tracks (connected components). ([Chapter 40][16])
-* `mosaic` — Mosaic (Tapa-like tiling). ([Chapter 42][17])
-* `chess_range` — Chess Range (chess moves). ([Puzzle-Chess][23])
-
----
-
 ## Testing
 
 To run the tests, simply run the following (to create a fresh conda environment and install the dev dependencies):
@@ -2090,3 +2169,4 @@ Issues and PRs welcome!
 [16]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/tracks "puzzle_solver/src/puzzle_solver/puzzles/tracks at master · Ar-Kareem/puzzle_solver · GitHub"
 [17]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/mosaic "puzzle_solver/src/puzzle_solver/puzzles/mosaic at master · Ar-Kareem/puzzle_solver · GitHub"
 [23]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"
+[24]: https://github.com/Ar-Kareem/puzzle_solver/tree/master/src/puzzle_solver/puzzles/chess_range#chess-solo-puzzle-type-24 "puzzle_solver/src/puzzle_solver/puzzles/chess_range at master · Ar-Kareem/puzzle_solver · GitHub"

{multi_puzzle_solver-0.8.7 → multi_puzzle_solver-0.9.0}/src/multi_puzzle_solver.egg-info/SOURCES.txt

@@ -9,7 +9,9 @@ src/puzzle_solver/__init__.py
 src/puzzle_solver/core/utils.py
 src/puzzle_solver/core/utils_ortools.py
 src/puzzle_solver/puzzles/bridges/bridges.py
+src/puzzle_solver/puzzles/chess_range/chess_melee.py
 src/puzzle_solver/puzzles/chess_range/chess_range.py
+src/puzzle_solver/puzzles/chess_range/chess_solo.py
 src/puzzle_solver/puzzles/dominosa/dominosa.py
 src/puzzle_solver/puzzles/filling/filling.py
 src/puzzle_solver/puzzles/guess/guess.py
@@ -34,7 +36,9 @@ src/puzzle_solver/puzzles/tracks/tracks.py
 src/puzzle_solver/puzzles/undead/undead.py
 src/puzzle_solver/puzzles/unruly/unruly.py
 tests/test_bridges.py
+tests/test_chess_melee.py
 tests/test_chess_range.py
+tests/test_chess_solo.py
 tests/test_dominosa.py
 tests/test_filling.py
 tests/test_guess.py

{multi_puzzle_solver-0.8.7 → multi_puzzle_solver-0.9.0}/src/puzzle_solver/__init__.py

@@ -1,5 +1,7 @@
 from puzzle_solver.puzzles.bridges import bridges as bridges_solver
 from puzzle_solver.puzzles.chess_range import chess_range as chess_range_solver
+from puzzle_solver.puzzles.chess_range import chess_solo as chess_solo_solver
+from puzzle_solver.puzzles.chess_range import chess_melee as chess_melee_solver
 from puzzle_solver.puzzles.dominosa import dominosa as dominosa_solver
 from puzzle_solver.puzzles.filling import filling as filling_solver
 from puzzle_solver.puzzles.guess import guess as guess_solver
@@ -24,4 +26,4 @@ from puzzle_solver.puzzles.unruly import unruly as unruly_solver
 
 from puzzle_solver.puzzles.inertia.parse_map.parse_map import main as inertia_image_parser
 
-__version__ = '0.8.7'
+__version__ = '0.9.0'