Heuristic search is widely used in games for pathfinding and general planning. High-quality heuristic functions are key to finding a low-cost solution quickly. Commonly used heuristic functions for video-game pathfinding are either manually designed and generic or pre-computed for a specific map. The former fail to take advantage of pathfinding specifics while the latter tend to have a large memory footprint, may require substantial pre-computation and are not portable to other maps or easily presentable to humans. In this work we attempt to combine the best of both approaches by automatically synthesizing well performing pathfinding-specific yet compact and human-readable heuristics. We do so by defining a space of algebraic formulae expressing heuristic functions and then conducting an automated search of the space. To make the synthesis tractable we employ a multi-tier evaluation which allows us to quickly filter out low-quality heuristics while saving time to more thoroughly evaluate better ones. Such triage of candidate heuristics enables us to synthesize compact heuristics that outperform the standard baseline on video-game pathfinding benchmarks. By then adding the synthesized heuristics back to the synthesis space we show that synthesis on new maps can be substantially sped up to merely few minutes per map.