{
  "id": 1077,
  "rank": 2939,
  "name": "BIG Candle",
  "aka": [
    "BIG-CANDLE.itf"
  ],
  "family": null,
  "subtype": null,
  "one_liner": "Enters trades based on a 'big candle' breaking the highest or lowest over the last 8 bars with an amplitude greater than ATR(24).",
  "market_regime": "trending|ranging|volatile|breakout|any",
  "timeframes": [
    "M15",
    "H1"
  ],
  "symbols": [
    "DAX"
  ],
  "sessions": [
    "09:00-17:00 GMT"
  ],
  "indicators": [
    {
      "name": "Highest",
      "params": {
        "period": 8
      },
      "applied_to": "high"
    },
    {
      "name": "Lowest",
      "params": {
        "period": 8
      },
      "applied_to": "low"
    },
    {
      "name": "AverageTrueRange",
      "params": {
        "period": 24
      },
      "applied_to": "null"
    }
  ],
  "entry_long": [
    "close > open",
    "close > Haut",
    "amplitude > ATR(24)",
    "time >= 090000 and time <= 170000"
  ],
  "entry_short": [
    "close < open",
    "close < Bas",
    "amplitude > ATR(24)",
    "time >= 090000 and time <= 170000"
  ],
  "exit_rules": [
    "none"
  ],
  "filters": [
    "none"
  ],
  "stop_loss": "20 in M15, 75 in H1",
  "take_profit": "stop loss * 2",
  "position_size": "n shares",
  "evidence_type": "source_code",
  "completeness": 80.0,
  "signal_warnings": null,
  "claim_warnings": null,
  "opacity_warnings": null,
  "build_warnings": null,
  "canonical": "https://prismaticalgos.com/compendium/algo/1077-big-candle",
  "snapshot": "2026-10-31 15:46 UTC",
  "source_url": "https://www.prorealcode.com/prorealtime-trading-strategies/big-candle-strategy/",
  "limitations": "These are machine-extracted research records, not verified trading systems. Catalog rank measures specification detail and claimed evidence, not profitability. The catalog extraction pipeline did not independently backtest these records. Its separate selected testing ledger does not validate the wider corpus. Rules, labels and parameters can be incomplete or wrong; consult the original source and its reuse terms."
}