Gurddy

2

Solve Constraint Satisfaction Problems (CSP), Linear Programming (LP), Minimax optimization, and SciPy-powered advanced optimization problems.

Visit Site GitHub PyPI
Category MCP Servers
Added Mar 28, 2026
Views 92

About

A comprehensive MCP server for the Gurddy optimization library that provides 18+ specialized tools for solving Constraint Satisfaction Problems (CSP), Linear Programming (LP), Game Theory, and SciPy-powered optimization problems. Built by the Gurddy MCP Team, it features dual transport support (stdio for IDE integration and HTTP/SSE for web clients), auto-generated schemas from function signatures for consistency, and includes classic problems like N-Queens, Sudoku, graph coloring, 24-point game, minimax games, portfolio optimization, and statistical fitting. The implementation uses a centralized tool registry system with pre-commit hooks for schema validation, Docker deployment support, and extensive examples, making it useful for AI assistants helping with mathematical optimization, operations research, game theory analysis, and educational problem-solving scenarios.

Is this your product? Claim this listing with an email at your domain to post updates.

Is this your project?

Claim this listing to manage your page, access analytics, and unlock upgrades. Verification takes 60 seconds.

Log In to Claim

Share This Project

Share on X Share on LinkedIn

Embed Badge

Add this badge to your README:

[![Listed on AiList](https://hifriendbot.com/ai-list/badge/gurddy.svg)](https://hifriendbot.com/ai-list/gurddy/)
Listed on AiList

Compare

Gurddy vs Constrained Optimization Gurddy vs Universal Solver (Z3, CVXPY, OR-Tools) Gurddy vs OR-Tools

Similar Projects

Constrained Optimization

3

Provides unified access to multiple optimization solvers including Z3, CVXPY, HiGHS, and OR-Tools for solving constraint satisfaction, convex optimization, linear programming, and combinatorial problems like portfolio optimization, production planning, scheduling, and classic puzzles with mathematic

MCP Servers

Universal Solver (Z3, CVXPY, OR-Tools)

65

Integrates Z3, CVXPY, and Google OR-Tools to solve constraint satisfaction, convex optimization, and scheduling problems with support for solver chaining where results from one solver feed into another for complex multi-stage optimization workflows.

MCP Servers

OR-Tools

17

Integrates Google's OR-Tools to solve constraint satisfaction and optimization problems for decision-making in logistics and operations research.

MCP Servers

List Your Project

Join the directory Ai agents read. Free forever.

Submit Your Project