Comprehensive Model Context Protocol server for managing Home Assistant through AI assistants.
Nothing to run from here
Spick Me — Swiss public transport is installed from its publisher's own source and answers where it runs, so this marketplace is not in the path of a single call. There is no address here to send one to, and a panel that pretended otherwise would be showing you an answer we made up. Install it and call it from your own client — the Installation tab has the entry for each one.
6
tools declared
—
trust score
remote
at its publisher
—
calls last 7d
What it does
Swiss trains, trams, buses and boats: journeys door to door, departures, day trips, travel-time maps
Quickstart
# 1 — add it to Claude Code
claude mcp add --scope user --transport http spick-me-swiss-public-transport-mcp https://spickme.ch/mcp
# 2 — ask your agent for something these tools do
# find_place, plan_journey, departures and 3 more
Spick Me — Swiss public transport costs nothing on mcprush: there is no plan to choose here, no cap to set and nothing mcprush can bill you for.
Publishernot claimed
SPAll 1 server
spickme1 server
1 category
Collected from a public index. Nobody has claimed this account, so nothing here was written by its author — claim it if it is yours.
Installation
Where are you running it?
Every route below installs the same thing and ends at the same approval screen. Nothing here runs on your machine and nothing runs on ours: this server answers at its publisher’s own address, and what you install is the connection straight to it.
Claude Codedeclared by this listing
This is a public server: it answers at its publisher’s own address and this marketplace is not in the path. Claude Code registers it in one command; --scope user makes it available in every project. The transport below is http, as the publisher's own manifest declares it.
claude mcp add --scope user --transport http spick-me-swiss-public-transport-mcp https://spickme.ch/mcpReconnect, or start a new session, and the tools appear in the model’s tool list.
Free on mcprush, and it answers at its publisher’s own address: this marketplace is not in the path, so there is no key of ours to hold and no card to add.
What it writes
One config entry pointing straight at the publisher’s own address — this marketplace is not in the path, and nothing from this listing executes on your machine.
What you approve
6 tools, with what each one reads, writes and reaches shown before you agree — the same list on every route above. Read the tool surface.
Tool surface
What the model actually sees. Descriptions are diffed on every release — see version history.
Look up what a place name means in the Swiss public-transport network: stations and stops, street addresses, and named places (a university, a museum, a mountain), ranked best first, each with a stable place_id. Use it when the user names a place you are not sure of, when another tool answered that a name is ambiguous, or to get coordinates for a place. You do not need it before plan_journey or d
| Parameter | Type | Required | Notes |
|---|---|---|---|
| limit | integer | no | How many candidates to return, best first. |
| near | object | no | Where the user is, if known: prefers nearer matches among equally good ones. |
| query | string | yes | The name, address or coordinate to look up. |
Find the best connections by train, tram, bus, boat and mountain railway between two places in Switzerland, from Spick Me's own routing engine over the official Swiss timetable. Door to door: an address or a named place works as well as a station, and the walk to and from the nearest stops is included. Use it for "how do I get from A to B", "the next connections from Olten to Zürich", "when is th
| Parameter | Type | Required | Notes |
|---|---|---|---|
| arrival | string | no | Arrive by this time. Give this or departure, not both. |
| departure | string | no | Leave at or after this time. Omit both departure and arrival for now. |
| from | string | yes | Where the journey starts. |
| limit | integer | no | How many alternative journeys to return. |
| max_transfers | integer | no | The most changes of vehicle allowed; 0 for direct connections only. |
| to | string | yes | Where the journey ends. |
| transfer_time_factor | number | no | How much time to allow for changing trains, as a multiple of the timetable's minimum change times: 1 (default) is the timetable's own; 1.5 for luggage, children or reduced mobility; 0.7 for a fast wal |
| via | array | no | Stations or stops the journey must pass through, in order. With via, one best journey is returned. |
List the next departures from one station or stop, as the board on the platform would: time, line, direction, platform, kind of vehicle, and the next stops it calls at. Use it for "what leaves from Bern in the next hour", "when is the next tram from Bellevue", or to see how often a place is served. With to, it lists only what calls at that station later, each with its arrival time there — "trains
| Parameter | Type | Required | Notes |
|---|---|---|---|
| limit | integer | no | How many departures to list. |
| station | string | yes | The station or stop whose board to show. |
| time | string | no | When the board starts. Omit for now. |
| to | string | no | Only departures that call at this station later, with their arrival there. |
Plan a whole day of public transport with time spent at each stop: the train there, the hours somewhere, the connection on, and the way home — each leg timed from when the previous stay actually ends. This is Spick Me's day-out planner; no plain journey planner answers this in one call. Use it for "a day trip from Bern to Grindelwald with four hours hiking, then dinner in Interlaken", "visit Thun
| Parameter | Type | Required | Notes |
|---|---|---|---|
| departure | string | no | When the day starts. Omit for now. |
| end | string | no | Where the day ends; defaults to start. |
| start | string | yes | Where the day starts. |
| stops | array | yes | The places to visit, in order. |
| transfer_time_factor | number | no | How much time to allow for changing trains, as a multiple of the timetable's minimum change times: 1 (default) is the timetable's own; 1.5 for luggage, children or reduced mobility; 0.7 for a fast wal |
List every station and stop in Switzerland reachable from one place within a number of minutes by public transport, nearest first, with the earliest arrival at each. One call answers what would otherwise be hundreds of journey searches. Use it for "where can I get to from Bern in 45 minutes", "which towns are within an hour's commute of Zug", catchment areas and isochrones. For the travel time be
| Parameter | Type | Required | Notes |
|---|---|---|---|
| departure | string | no | When to leave. Omit for now. |
| from | string | yes | Where to start. |
| limit | integer | no | How many places to list, nearest first. |
| max_minutes | integer | no | The time budget in minutes, waiting included. |
| max_transfers | integer | no | The most changes of vehicle allowed. |
| transfer_time_factor | number | no | How much time to allow for changing trains, as a multiple of the timetable's minimum change times: 1 (default) is the timetable's own; 1.5 for luggage, children or reduced mobility; 0.7 for a fast wal |
Compute the public-transport travel time in minutes from each of several origins to each of several destinations in Switzerland, for one departure time. One search per origin, however many destinations — built for comparing locations: which office site is best reached from where staff live, which flat has the shortest commutes, how well a venue is connected. Use it when there are several places o
| Parameter | Type | Required | Notes |
|---|---|---|---|
| departure | string | no | When to leave. Omit for now. |
| destinations | array | yes | Where each column of the matrix ends. |
| max_transfers | integer | no | The most changes of vehicle allowed. |
| origins | array | yes | Where each row of the matrix starts. |
| transfer_time_factor | number | no | How much time to allow for changing trains, as a multiple of the timetable's minimum change times: 1 (default) is the timetable's own; 1.5 for luggage, children or reduced mobility; 0.7 for a fast wal |
Free
$0 forever
- Every tool — any call limit is its publisher’s, not ours
- No card, and mcprush charges nothing for it
- Runs at its publisher’s own address — this marketplace is not in the path
- Nothing to cap, because mcprush bills nothing
What counts against your monthly calls
| Tool | Unit | Calls used | Out of the allowance |
|---|
Nothing here is billable: mcprush charges nothing to install Spick Me — Swiss public transport or to call it, at any volume.
Call allowance · this installenforced at the gateway
Monthly allowance, in calls
—
—
Alert at 80% · then the tool returns a normal MCP error
Used this month: —
—Grade not published
No rule-by-rule report on file for this release
Two independent axes, because powerful and malicious are different questions. The grade is threat only. The capability level is blast radius, and it is never a penalty on the grade — it is priced as one subtract-only term in the score, where you can see it.
This listing is an address its publisher runs, and you connect to it directly — this marketplace is not in the path. The scanner reads packages and public source, and an address is neither. So there is no grade — not a withheld one, an unmeasured one.
Release history
This is an address its publisher runs: which release it serves is theirs to choose, so there is nothing here to pin. The history below is for reading; the current release on file is 1.0.0.
1.0.0
undated
latestNo release note was published with this version.
—
no reviews yet
Who can review
One review per account, from a signed-in account that does not publish this listing. Nothing else is asked — you can say what you think before you install it. Publishers can reply once per review, and a review can be edited or deleted by whoever wrote it.
Sign in to write one
Any signed-in account that does not publish Spick Me — Swiss public transport can review it, once — before installing it or after. A review from an account that has installed it is marked as one.
No reviews yet
Nobody has reviewed this listing. The rating on the card is the mean of the reviews written here and nothing else, so there is no rating until somebody writes the first — which takes a signed-in account that does not publish it, and nothing else.