pith. sign in

− For maximum Manhattan distance, we can calculate: − max((x1+y1) − (x2+y2)) and max((x1−y1) − (x2−y2)) − This is done by tracking max and min of (x+y) and (x−y) for both players

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.AI 1

years

2026 1

verdicts

UNVERDICTED 1

roles

background 1

polarities

background 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.