solvor 0.3.1__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,25 @@
1
+ name: CI
2
+
3
+ on:
4
+ push:
5
+ branches: [main, dev]
6
+ pull_request:
7
+ branches: [main]
8
+
9
+ jobs:
10
+ test:
11
+ runs-on: ubuntu-latest
12
+ steps:
13
+ - uses: actions/checkout@v4
14
+
15
+ - name: Install uv
16
+ uses: astral-sh/setup-uv@v4
17
+
18
+ - name: Install dependencies
19
+ run: uv sync --extra dev
20
+
21
+ - name: Run linter
22
+ run: uv run ruff check src/
23
+
24
+ - name: Run tests
25
+ run: uv run pytest tests/ -v
@@ -0,0 +1,39 @@
1
+ name: Publish to PyPI
2
+
3
+ on:
4
+ release:
5
+ types: [published]
6
+
7
+ jobs:
8
+ build:
9
+ runs-on: ubuntu-latest
10
+ steps:
11
+ - uses: actions/checkout@v4
12
+
13
+ - name: Install uv
14
+ uses: astral-sh/setup-uv@v4
15
+
16
+ - name: Build package
17
+ run: uv build
18
+
19
+ - name: Upload dist
20
+ uses: actions/upload-artifact@v4
21
+ with:
22
+ name: dist
23
+ path: dist/
24
+
25
+ publish:
26
+ needs: build
27
+ runs-on: ubuntu-latest
28
+ environment: pypi
29
+ permissions:
30
+ id-token: write
31
+ steps:
32
+ - name: Download dist
33
+ uses: actions/download-artifact@v4
34
+ with:
35
+ name: dist
36
+ path: dist/
37
+
38
+ - name: Publish to PyPI
39
+ uses: pypa/gh-action-pypi-publish@release/v1
@@ -0,0 +1,14 @@
1
+ # Python
2
+ __pycache__/
3
+ *.egg-info/
4
+ dist/
5
+ .venv/
6
+ .cl*/*
7
+
8
+ # Tools
9
+ .python-version
10
+ .ruff_cache/
11
+ .mypy_cache/
12
+ .pytest_cache/
13
+ .coverage
14
+ uv.lock
@@ -0,0 +1,80 @@
1
+ # Contributing to Solvor
2
+
3
+ Thanks for your interest in contributing to Solvor!
4
+
5
+ ## Development Setup
6
+
7
+ ```bash
8
+ # Clone the repo
9
+ git clone https://github.com/StevenBtw/solvor.git
10
+ cd solvor
11
+
12
+ # Install with dev dependencies
13
+ uv sync --extra dev
14
+
15
+ # Run tests
16
+ uv run pytest
17
+
18
+ # Run linter
19
+ uv run ruff check src/
20
+ ```
21
+
22
+ ## Code Style
23
+
24
+ Follow the project's style:
25
+
26
+ - **Pure Python** - no external dependencies
27
+ - **snake_case** everywhere
28
+ - **Type hints** on public APIs, skip for internal helpers
29
+ - **Keyword-only** for optional parameters (use `*`)
30
+ - **Minimal comments** - explain *why*, not *what*
31
+ - **Sets for membership** - O(1) lookup, not lists
32
+ - **Immutable state** - solutions passed between iterations should be immutable; working structures can mutate
33
+
34
+ ## Terminology
35
+
36
+ Use consistent naming across all solvers:
37
+
38
+ | Term | Usage |
39
+ |------|-------|
40
+ | `solution` | Current candidate being evaluated |
41
+ | `best_solution` | Best found so far |
42
+ | `objective` | Value being optimized |
43
+ | `objective_fn` | Function computing objective |
44
+ | `neighbors` | Adjacent solutions (metaheuristics) |
45
+ | `minimize` | Boolean flag (default `True`) |
46
+
47
+ ## Adding a New Solver
48
+
49
+ 1. Create `src/solvor/<solver_name>.py`
50
+ 2. Import shared types: `from solvor.types import Status, Result`
51
+ 3. Export `Status`, `Result`, and main solver function in `__all__`
52
+ 4. Add exports to `src/solvor/__init__.py`
53
+ 5. Add tests to `tests/test_solvers.py`
54
+ 6. Update `README.md` with usage examples
55
+
56
+ ## Testing
57
+
58
+ All solvers must have tests covering:
59
+ - Basic functionality
60
+ - Edge cases (empty input, infeasible, etc.)
61
+ - Minimize and maximize modes
62
+
63
+ ```bash
64
+ uv run pytest tests/ -v
65
+ ```
66
+
67
+ ## Pull Requests
68
+
69
+ 1. Fork the repo
70
+ 2. Create a feature branch
71
+ 3. Make your changes
72
+ 4. Run tests and linter
73
+ 5. Submit a PR with a clear description
74
+
75
+ ## Philosophy
76
+
77
+ 1. Working > perfect
78
+ 2. Readable > clever
79
+ 3. Simple > general
80
+ 4. Fast, but understandable
solvor-0.3.1/LICENSE ADDED
@@ -0,0 +1,201 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright [yyyy] [name of copyright owner]
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
solvor-0.3.1/PKG-INFO ADDED
@@ -0,0 +1,281 @@
1
+ Metadata-Version: 2.4
2
+ Name: solvor
3
+ Version: 0.3.1
4
+ Summary: Pure Python optimization solvers. No dependencies, no nonsense.
5
+ Project-URL: Repository, https://github.com/StevenBtw/solvor
6
+ Author: Steven Bytheway
7
+ License: MIT
8
+ License-File: LICENSE
9
+ Keywords: linear-programming,metaheuristics,operations-research,optimization,sat,solver
10
+ Classifier: Development Status :: 3 - Alpha
11
+ Classifier: Intended Audience :: Developers
12
+ Classifier: License :: OSI Approved :: MIT License
13
+ Classifier: Programming Language :: Python :: 3.14
14
+ Classifier: Topic :: Scientific/Engineering :: Mathematics
15
+ Requires-Python: >=3.14
16
+ Provides-Extra: dev
17
+ Requires-Dist: pytest>=9.0.2; extra == 'dev'
18
+ Requires-Dist: ruff>=0.14.9; extra == 'dev'
19
+ Description-Content-Type: text/markdown
20
+
21
+ # Solvor
22
+
23
+ ![Python 3.14+](https://img.shields.io/badge/python-3.14+-blue.svg)
24
+ ![License: MIT](https://img.shields.io/badge/license-MIT-green.svg)
25
+
26
+ Pure Python optimization solvers. No dependencies, no nonsense.
27
+
28
+ ## What's in the box?
29
+
30
+ | Category | Solvers | Use Case |
31
+ |----------|---------|----------|
32
+ | **Linear/Integer** | `solve_lp`, `solve_milp` | Resource allocation, scheduling |
33
+ | **Constraint** | `solve_sat`, `Model` | Sudoku, configuration, puzzles |
34
+ | **Local Search** | `anneal`, `tabu_search` | TSP, combinatorial optimization |
35
+ | **Population** | `evolve` | When you want nature to do the work |
36
+ | **Continuous** | `gradient_descent`, `momentum`, `adam` | ML, curve fitting |
37
+ | **Black-box** | `bayesian_opt` | Hyperparameter tuning, expensive functions |
38
+ | **Graph** | `max_flow`, `min_cost_flow`, `solve_assignment` | Matching, transportation |
39
+
40
+ ---
41
+
42
+ ## Quickstart
43
+
44
+ ```bash
45
+ uv add solvor
46
+ ```
47
+
48
+ ```python
49
+ from solvor import solve_lp, solve_tsp, anneal, Model
50
+
51
+ # Linear Programming
52
+ result = solve_lp(c=[1, 2], A=[[1, 1], [2, 1]], b=[4, 5])
53
+ print(result.solution) # optimal x
54
+
55
+ # TSP with tabu search
56
+ distances = [[0, 10, 15], [10, 0, 20], [15, 20, 0]]
57
+ result = solve_tsp(distances)
58
+ print(result.solution) # best tour found
59
+
60
+ # Constraint satisfaction
61
+ m = Model()
62
+ x = m.int_var(1, 9, 'x')
63
+ y = m.int_var(1, 9, 'y')
64
+ m.add(m.all_different([x, y]))
65
+ m.add(m.sum_eq([x, y], 10))
66
+ result = m.solve()
67
+ print(result.solution) # {'x': 3, 'y': 7}
68
+ ```
69
+
70
+ ---
71
+
72
+ ## Solvers
73
+
74
+ <details>
75
+ <summary><strong>Linear & Integer Programming</strong></summary>
76
+
77
+ ### solve_lp
78
+ Two-phase simplex for linear programming.
79
+
80
+ ```python
81
+ # minimize 2x + 3y subject to x + y >= 4, x <= 3
82
+ result = solve_lp(
83
+ c=[2, 3],
84
+ A=[[-1, -1], [1, 0]], # constraints as Ax <= b
85
+ b=[-4, 3]
86
+ )
87
+ ```
88
+
89
+ ### solve_milp
90
+ Branch and bound for mixed-integer problems.
91
+
92
+ ```python
93
+ # same as above, but x must be integer
94
+ result = solve_milp(c=[2, 3], A=[[-1, -1], [1, 0]], b=[-4, 3], integers=[0])
95
+ ```
96
+
97
+ </details>
98
+
99
+ <details>
100
+ <summary><strong>Constraint Programming</strong></summary>
101
+
102
+ ### solve_sat
103
+ DPLL with unit propagation and clause learning.
104
+
105
+ ```python
106
+ # (x1 OR x2) AND (NOT x1 OR x3) AND (NOT x2 OR NOT x3)
107
+ result = solve_sat([[1, 2], [-1, 3], [-2, -3]])
108
+ print(result.solution) # {1: True, 2: False, 3: True}
109
+ ```
110
+
111
+ ### Model (CP-SAT)
112
+ Constraint programming via SAT encoding.
113
+
114
+ ```python
115
+ m = Model()
116
+ cells = [[m.int_var(1, 9, f'c{i}{j}') for j in range(9)] for i in range(9)]
117
+
118
+ # All different in each row
119
+ for row in cells:
120
+ m.add(m.all_different(row))
121
+
122
+ result = m.solve()
123
+ ```
124
+
125
+ </details>
126
+
127
+ <details>
128
+ <summary><strong>Metaheuristics</strong></summary>
129
+
130
+ ### anneal
131
+ Simulated annealing - accepts worse solutions probabilistically.
132
+
133
+ ```python
134
+ result = anneal(
135
+ initial=initial_solution,
136
+ objective_fn=cost_function,
137
+ neighbors=random_neighbor,
138
+ temperature=1000,
139
+ cooling=0.9995
140
+ )
141
+ ```
142
+
143
+ ### tabu_search
144
+ Maintains a "tabu list" of recent moves to escape local optima.
145
+
146
+ ```python
147
+ result = tabu_search(
148
+ initial=initial_solution,
149
+ objective_fn=cost_function,
150
+ neighbors=get_neighbors, # returns [(move, solution), ...]
151
+ cooldown=10
152
+ )
153
+ ```
154
+
155
+ ### evolve
156
+ Genetic algorithm with selection, crossover, mutation.
157
+
158
+ ```python
159
+ result = evolve(
160
+ objective_fn=fitness,
161
+ population=initial_pop,
162
+ crossover=my_crossover,
163
+ mutate=my_mutate,
164
+ max_gen=100
165
+ )
166
+ ```
167
+
168
+ </details>
169
+
170
+ <details>
171
+ <summary><strong>Continuous Optimization</strong></summary>
172
+
173
+ ### gradient_descent / momentum / adam
174
+ First-order methods for differentiable functions.
175
+
176
+ ```python
177
+ def grad_fn(x):
178
+ return [2 * x[0], 2 * x[1]] # gradient of x^2 + y^2
179
+
180
+ result = adam(grad_fn, x0=[5.0, 5.0])
181
+ print(result.solution) # [~0, ~0]
182
+ ```
183
+
184
+ ### bayesian_opt
185
+ Gaussian process surrogate for expensive black-box functions.
186
+
187
+ ```python
188
+ def expensive_fn(x):
189
+ # imagine this takes 10 minutes to evaluate
190
+ return (x[0] - 0.3)**2 + (x[1] - 0.7)**2
191
+
192
+ result = bayesian_opt(expensive_fn, bounds=[(0, 1), (0, 1)], max_iter=30)
193
+ ```
194
+
195
+ </details>
196
+
197
+ <details>
198
+ <summary><strong>Network Flow</strong></summary>
199
+
200
+ ### max_flow
201
+ Ford-Fulkerson with BFS (Edmonds-Karp).
202
+
203
+ ```python
204
+ graph = {
205
+ 's': [('a', 10, 0), ('b', 5, 0)],
206
+ 'a': [('b', 15, 0), ('t', 10, 0)],
207
+ 'b': [('t', 10, 0)],
208
+ 't': []
209
+ }
210
+ result = max_flow(graph, 's', 't')
211
+ print(result.objective) # total flow
212
+ print(result.solution) # edge flows dict
213
+ ```
214
+
215
+ ### min_cost_flow / solve_assignment
216
+ Successive shortest paths for minimum cost flow.
217
+
218
+ ```python
219
+ # Assignment problem: 3 workers, 3 tasks
220
+ costs = [
221
+ [10, 5, 13],
222
+ [3, 9, 18],
223
+ [10, 6, 12]
224
+ ]
225
+ result = solve_assignment(costs)
226
+ # result.solution[i] = task assigned to worker i
227
+ # result.objective = total cost
228
+ ```
229
+
230
+ </details>
231
+
232
+ ---
233
+
234
+ ## Result Format
235
+
236
+ All solvers return a consistent `Result` namedtuple:
237
+
238
+ ```python
239
+ Result(
240
+ solution, # best solution found
241
+ objective, # objective value
242
+ iterations, # solver iterations (pivots, generations, etc.)
243
+ evaluations, # function evaluations
244
+ status # OPTIMAL, FEASIBLE, INFEASIBLE, UNBOUNDED, MAX_ITER
245
+ )
246
+ ```
247
+
248
+ ---
249
+
250
+ ## When to use what?
251
+
252
+ | Problem | Solver |
253
+ |---------|--------|
254
+ | Linear constraints, continuous variables | `solve_lp` |
255
+ | Linear constraints, some integers | `solve_milp` |
256
+ | Boolean satisfiability | `solve_sat` |
257
+ | Discrete variables, complex constraints | `Model` |
258
+ | Combinatorial, good initial solution | `tabu_search`, `anneal` |
259
+ | Combinatorial, no clue where to start | `evolve` |
260
+ | Smooth, differentiable | `adam` |
261
+ | Expensive black-box | `bayesian_opt` |
262
+ | Assignment, matching, flow | `max_flow`, `solve_assignment` |
263
+
264
+ ---
265
+
266
+ ## Philosophy
267
+
268
+ 1. **Pure Python** - no numpy, no scipy, no compiled extensions
269
+ 2. **Readable** - each solvor fits in one file you can actually read
270
+ 3. **Consistent** - same Result format, same minimize/maximize convention
271
+ 4. **Practical** - solves real problems, or AoC puzzles
272
+
273
+ ---
274
+
275
+ ## Contributing
276
+
277
+ See [CONTRIBUTING.md](CONTRIBUTING.md) for development setup and guidelines.
278
+
279
+ ## License
280
+
281
+ [MIT License](LICENSE) - free for personal and commercial use.