MCP-to-MCP Tic-Tac-Toe
Rank #52263glama/PsychoSmiley/mcp-to-mcp
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.
MCP-to-MCP Tic-Tac-Toe is a Model Context Protocol (MCP) server published by PsychoSmiley. It ranks #52263 of 58,900 servers tracked on MCP Toplist. MCP-to-MCP Tic-Tac-Toe is listed on Glama, and ships as a single rolling release with no explicit version metadata. It was first listed on Mar 17, 2026.
Ranks ahead of 6,637 of 58,900 servers on MCP Toplist.
Use MCP-to-MCP Tic-Tac-Toe
MCP-to-MCP Tic-Tac-Toe doesn’t publish a machine-readable install config. Follow the setup instructions in its repository ↗, or open one of its registry listings above.
Listed on 1 registry
PsychoSmiley
Not versioned
This server is published through a registry that does not expose explicit version metadata, and no GitHub release tags were found on the linked repository. The listing tracks a single rolling release.
Frequently asked questions
- What is MCP-to-MCP Tic-Tac-Toe?
- 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.
- Who maintains MCP-to-MCP Tic-Tac-Toe?
- MCP-to-MCP Tic-Tac-Toe is maintained by PsychoSmiley, which publishes 1 MCP server (0 total versions) tracked on MCP Toplist.
- Is MCP-to-MCP Tic-Tac-Toe an official MCP server?
- MCP-to-MCP Tic-Tac-Toe is not on the Official MCP Registry. It is listed on Glama.
- How many versions does MCP-to-MCP Tic-Tac-Toe have?
- MCP-to-MCP Tic-Tac-Toe ships as a single rolling release with no explicit version metadata.
- Where can I find the source code for MCP-to-MCP Tic-Tac-Toe?
- The source code for MCP-to-MCP Tic-Tac-Toe is hosted at github.com/PsychoSmiley/mcp-to-mcp.