Skip to main content
Glama
74,582 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Methods to Improve or Enhance a Prompt" matching MCP servers:

  • MCP-to-MCP Tic-Tac-Toe

    PsychoSmiley
    A
    license
    B
    quality
    D
    maintenance
    Enables two LLMs to play Tic-Tac-Toe against each other autonomously using a shared tool and an SSE relay. The server facilitates agent-to-agent communication by holding tool responses until the opponent makes a move, managing the game state in real-time.
    1
    Apache 2.0

  • framebench MCP server

    aistripes
    A
    license
    -
    quality
    C
    maintenance
    Estimates FPS ranges for games on any GPU or Apple Silicon, identifies the limiting component, and provides settings levers to improve performance.
    1
    MIT

  • legendsviewer-mcp

    Hadows
    A
    license
    A
    quality
    B
    maintenance
    MCP server that lets AI assistants read and query Dwarf Fortress world legends: search events, objects, and properties, or read summaries and base rates to distinguish real patterns from common traits.
    10
    MIT

  • isaac-wiki-mcp

    3113y
    A
    license
    A
    quality
    C
    maintenance
    Provides full class documentation for the Binding of Isaac modding API, enabling AI assistants to access complete class pages with methods, enums, and tutorials to avoid hallucination.
    4
    MIT

  • conviction-mcp

    abcxz
    A
    license
    A
    quality
    D
    maintenance
    Strategy competition for AI agents. Task your agent to make money. Prompt a strategy, open positions according to pre-set rules and capture revenue from the competition pools.
    11
    1
    MIT

  • lemonade-bench

    mxmarchal
    A
    license
    A
    quality
    C
    maintenance
    Enables tool-using language models to play Lemonade Tycoon Deluxe as a text-only business benchmark, exposing game UI state and actions as semantic MCP tools without vision or shell access.
    23
    MIT

  • topgg-mcp

    Paillat-dev
    A
    license
    A
    quality
    C
    maintenance
    Enables AI assistants to manage Top.gg bot or server listings, including updating project info, checking votes, posting metrics, and registering commands.
    8
    28
    3
    ISC

  • sbwsz-mcp

    lieyanqzu
    A
    license
    A
    quality
    D
    maintenance
    Provide seamless access to Magic: The Gathering Chinese card data from 大学院废墟(sbwsz.com) through a set of powerful query tools. Search cards by complex criteria, retrieve card sets, and get detailed card information to enhance your applications or workflows.
    6
    26
    1
    MIT

  • baselings-mcp

    jimbo530
    A
    license
    B
    quality
    C
    maintenance
    MCP server for AI agents to play Baselings, a yield-generating pet game on Base chain. Enables agents to manage workers, claim yields, and execute strategies to earn USDC, ETH, or BTC.
    49
    34
    MIT

  • habitica-mcp

    tatemz
    A
    license
    C
    quality
    B
    maintenance
    Habitica MCP server built with Effect v4, currently exposing a hello-world tool, resource, and prompt over stdio for early development and testing.
    1
    11
    MIT
  • Cinevva Game Engine by cinevva-engine

    Cinevva Game Engineofficial

    cinevva-engine
    A
    license
    -
    quality
    C
    maintenance
    Turn the AI you already use into a game studio. Describe a game and Claude or Cursor builds it as a real 3D browser game: playable immediately, hosted on its own link, shareable with anyone. No engine, no build step, no code knowledge, nothing to export. Your AI ships the whole thing: it pulls free 3D assets, rigs characters, and playtests its own build until the game works. Free to start.
    MIT

  • space-invaders-tui

    Avee4k
    A
    license
    -
    quality
    B
    maintenance
    MCP server that lets LLMs play a terminal Space Invaders game with the SUPERHOT rule: time only moves when the agent moves. Exposes tools to start a game, inspect the board state, and act by holding left/right/fire for N frames.
    305
    1
    MIT