FA-82981 / Go territory scoring / Open access
Lower-case vertices and "pass" are rejected · case 01
Engines sending d4 or pass get "invalid".
ROOT CAUSE
The text is only stripped, not upper-cased.
THE FAILURE
The text is only stripped, not upper-cased.
Unsuccessful approach: Upper-casing without stripping still rejects vertices padded with spaces.
Case contract
Input [size, text]. Case-insensitive, surrounding blanks ignored; "pass" -> "pass". Column letters A..Z skipping I; row numbers count from 1 at the bottom. Return [row_from_top, col] or "invalid".
Why this case matters
Go servers and scoring tools compute this value automatically; a wrong answer changes a game result.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(x):
size, text = x
t = text.strip()
if t == 'PASS':
return 'pass'
if len(t) < 2 or not t[1:].isdigit():
return 'invalid'
letters = 'ABCDEFGHJKLMNOPQRSTUVWXYZ'
if t[0] not in letters:
return 'invalid'
col = letters.index(t[0])
num = int(t[1:])
if col >= size or num < 1 or num > size:
return 'invalid'
return [size - num, col]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[[[9, 'd4'], [5, 3]], [[9, 'pass'], 'pass'], [[9, 'PASS'], 'pass'], [[9, ' Pass'], 'pass'], [[9, 'Z1'], 'invalid'], [[9, 'A0'], 'invalid'], [[9, 'A9'], [0, 0]], [[25, ' D4 '], [21, 3]]], [[[9, 'A10'], 'invalid'], [[9, 'K1'], 'invalid'], [[9, 'O3'], 'invalid'], [[9, 'Q16'], 'invalid'], [[9, 'X'], 'invalid'], [[9, ''], 'invalid'], [[9, 'j9'], [0, 8]], [[13, ' Pass'], 'pass']], [[[9, ' D4 '], [5, 3]], [[9, 'Y25'], 'invalid'], [[9, 'N13'], 'invalid'], [[9, 'M9'], 'invalid'], [[13, 'D4'], [9, 3]], [[13, 'd4'], [9, 3]], [[13, ' D4 '], [9, 3]], [[13, ' Pass'], 'pass']], [[[13, 'A1'], [12, 0]], [[13, 'T19'], 'invalid'], [[13, 'J10'], [3, 8]], [[13, 'I5'], 'invalid'], [[13, 'H8'], [5, 7]], [[13, 'pass'], 'pass'], [[19, 'pass'], 'pass'], [[19, ' Pass'], 'pass']], [[[13, ' D4 '], [9, 3]], [[13, 'Z1'], 'invalid'], [[13, 'A0'], 'invalid'], [[13, 'A13'], [0, 0]], [[13, 'A14'], 'invalid'], [[13, 'K1'], [12, 9]], [[13, 'O3'], 'invalid'], [[25, 'd4'], [21, 3]]]]
for i, (args, expected) in enumerate(fixtures[N-1]):
check("vertex case %d" % i, solve(args), expected)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| vertex case 0 | invalid | [5, 3] | Failed |
| vertex case 1 | invalid | pass | Failed |
| vertex case 2 | pass | pass | Passed |
| vertex case 3 | invalid | pass | Failed |
| vertex case 4 | invalid | invalid | Passed |
| vertex case 5 | invalid | invalid | Passed |
| vertex case 6 | [0, 0] | [0, 0] | Passed |
| vertex case 7 | [21, 3] | [21, 3] | Passed |
SHA-256 / fc8872268e0a2c877e03514f659232014d57df0bb6a24486ded10ed3fbd7e8a1
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(x):
size, text = x
t = text.upper()
if t == 'PASS':
return 'pass'
if len(t) < 2 or not t[1:].isdigit():
return 'invalid'
letters = 'ABCDEFGHJKLMNOPQRSTUVWXYZ'
if t[0] not in letters:
return 'invalid'
col = letters.index(t[0])
num = int(t[1:])
if col >= size or num < 1 or num > size:
return 'invalid'
return [size - num, col]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
fixtures = [[[[9, 'd4'], [5, 3]], [[9, 'pass'], 'pass'], [[9, 'PASS'], 'pass'], [[9, ' Pass'], 'pass'], [[9, 'Z1'], 'invalid'], [[9, 'A0'], 'invalid'], [[9, 'A9'], [0, 0]], [[25, ' D4 '], [21, 3]]], [[[9, 'A10'], 'invalid'], [[9, 'K1'], 'invalid'], [[9, 'O3'], 'invalid'], [[9, 'Q16'], 'invalid'], [[9, 'X'], 'invalid'], [[9, ''], 'invalid'], [[9, 'j9'], [0, 8]], [[13, ' Pass'], 'pass']], [[[9, ' D4 '], [5, 3]], [[9, 'Y25'], 'invalid'], [[9, 'N13'], 'invalid'], [[9, 'M9'], 'invalid'], [[13, 'D4'], [9, 3]], [[13, 'd4'], [9, 3]], [[13, ' D4 '], [9, 3]], [[13, ' Pass'], 'pass']], [[[13, 'A1'], [12, 0]], [[13, 'T19'], 'invalid'], [[13, 'J10'], [3, 8]], [[13, 'I5'], 'invalid'], [[13, 'H8'], [5, 7]], [[13, 'pass'], 'pass'], [[19, 'pass'], 'pass'], [[19, ' Pass'], 'pass']], [[[13, ' D4 '], [9, 3]], [[13, 'Z1'], 'invalid'], [[13, 'A0'], 'invalid'], [[13, 'A13'], [0, 0]], [[13, 'A14'], 'invalid'], [[13, 'K1'], [12, 9]], [[13, 'O3'], 'invalid'], [[25, 'd4'], [21, 3]]]]
for i, (args, expected) in enumerate(fixtures[N-1]):
check("vertex case %d" % i, solve(args), expected)
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| vertex case 0 | [5, 3] | [5, 3] | Passed |
| vertex case 1 | pass | pass | Passed |
| vertex case 2 | pass | pass | Passed |
| vertex case 3 | invalid | pass | Failed |
| vertex case 4 | invalid | invalid | Passed |
| vertex case 5 | invalid | invalid | Passed |
| vertex case 6 | [0, 0] | [0, 0] | Passed |
| vertex case 7 | invalid | [21, 3] | Failed |
SHA-256 / 84a221788e98c5c4c903b672ba94881ae2678690ab3dec1d7bce0d6b7f67c4d1
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 8 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.
Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.
Member access is invitation-based. Sign in with your invited account to inspect the repair.
Sign in to the archive ↗Verification & scope
Small rectangular toy boards given as strings of B, W and dot; a bounded teaching model of one scoring or bookkeeping rule, not a complete rules engine or server implementation. This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.
Observations recorded using Python 3.12.14 at 2026-09-29T14:50:17.218740+00:00.
Case digest / 66a5c46a9acd4c991cee491889bad4a0914ccebf29fe09b48bdcc75eb4ce97f4