mcp-bbc-goodfood

BBC Good Food is a British cooking site, the online home of the magazine of the same name. Its recipes are written and tested by its own cooks, and each one gives its ingredients, its method, its preparation and cooking times, its difficulty, the diets it suits, its nutrition per serving and the stars its readers gave it. The site narrows its recipes along axes of its own: a diet, a cuisine, a kind of meal, a difficulty. Part of the collection sits behind a subscription.

This server connects a chat client to that site. You can read the values each axis takes, search the recipes along them, read one recipe with its ingredients rescaled to the number of people at your table, and switch its quantities between metric and US units. It needs no API key and no account.

Version française

Install

One-click install

Claude Code

claude mcp add bbc-goodfood -- npx -y mcp-bbc-goodfood

Claude Desktop, Cursor, and any client using the standard config format

{
  "mcpServers": {
    "bbc-goodfood": {
      "command": "npx",
      "args": ["-y", "mcp-bbc-goodfood"]
    }
  }
}

Node 24 or later is required, and no environment variable has to be set.

With Docker

{
  "mcpServers": {
    "bbc-goodfood": {
      "command": "docker",
      "args": ["run", "-i", "--rm", "ghcr.io/smeet666/mcp-bbc-goodfood:1.0.1"]
    }
  }
}

-i keeps stdin open, which is where the protocol travels, and -t is left out because a TTY rewrites the stream. The container needs outbound HTTPS to www.bbcgoodfood.com, and nothing else: no volume, no port, no credential.

Bundle, without npm

Download mcp-bbc-goodfood-1.0.1.mcpb from the latest release and open it. A client that supports MCP bundles installs it on its own, with no npm and no configuration file to edit. The bundle carries its dependencies, so nothing is fetched at install time.

What you can ask

• "Find me a vegetarian curry that takes under 40 minutes."
• "What diets can I filter on?"
• "Read me that recipe for six, in US cups."
• "Which of these are rated four stars or better?"
• "Scale this ingredient list from a magazine by 1.5."

The ordinary path runs list_filters, then search_recipes, then get_recipe on the path a row carries.

Tools

Call list_filters before narrowing a search. The site accepts any value on an axis and answers one it does not know with a total of zero, so a guessed spelling comes back as a confident absence instead of a refusal.

list_filters

Reads the axes the site narrows by, and the values each one takes.

In return: filters, one entry per axis carrying name and label in the site's own wording, argument, which names the argument search_recipes takes for it, and options with each value, its label and its count. A count the site published nothing for is null. option_count says how many options are listed here, which is fewer than the site accepts: the values returned are the most frequent ones, and an option absent from the list is still usable. Counts are measured inside a scope, so passing query counts within one search and leaving it out counts across the listing; the two answer different questions.

search_recipes

Searches the recipes, narrowed along the site's own axes and along restrictions this server applies to the rows it read.

In return: rows carrying id, which get_recipe takes; title; url; image_url; and rating, which is null where the site published none. Alongside come result_count, rows_seen for the rows the site served before anything was set aside, and total_available. A total marked total_is_ceiling sits on the largest number of rows one search will serve, so it states a floor rather than a count. restrictions_lifted names what was set aside when narrowing made the search fail, and premium_dropped counts the subscription rows removed. The site offers no restriction on subscription rows, so exclude_premium removes them after the page arrives: a page then comes back shorter than the limit asked for, and a short page is not the end of the results.

get_recipe

Reads one recipe, rescaled to a number of servings and in the unit system asked for.