Olympiad Number Theory · Superchallenge problem

Ten points are placed in a $3\times3$ square. By the pigeonhole principle (divide the square into nine unit squares), some two points are at distance at most $d$. What is the smallest such guaranteed $d$? Express in simplest radical form.