In problem 4 from http://projecteuler.net/ it says:
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-d
580085 = 995 X 583, where 906609 = 993 X 913. Found it only by applying brute-forcing from top to bottom!