title: Project Euler - Largest Palindrome #4 Python
body: <p>I'm new to python and decided it would be a good idea to improve my coding (in general) by doing some of the challenges on project Euler. I'm currently stuck on problem 4 and i'm not sure what is going wrong (for those not in the know, problem 4 is as follows):</p>
  
  <blockquote>
    <p>A palindromic number reads the same both ways.</p>
    
    <p>The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99.</p>
  </blockquote>
  
  <p>Find the largest palindrome made from the product of two 3-digit numbers.</p>
  
  <pre><code>x, y = 999, 999
  palindrome = []
  while True:
      palindrome = [i for i in str(x * y)]
      r_palindrome = palindrome[::-1]
      if palindrome == r_palindrome:
          break
      else:
          y -= 1
          if y &lt; 100: 
              y = x
              x -= 1
  print x, y, palindrome
  </code></pre>
  
  <p>I seem to get the answer <code>987 * 286 = 282282</code> which feels awfully low. 
  Can someone explain the best way of doing this and what my current code is doing wrong rather than just a simple "here is the code" answer please. </p>