If this piece moves from h1 to a8 in as minimal moves (and minimal distance) as possible, what is the distance (by square) traveled for each of these pieces:
Bishop on f1
Queen on d1
Rook on h1 done by @Morvon4399
Rook on a1
King on e1
Knight on b1
Knight on g1
Pawn on c2 (You have to use the fact that it has to promote first before it can go to h1 )
Note: For each of the pieces, they have to get to h1 from their position, then go to a8. Knight's move is the hypotenuse of the L shape they make, not the L shape
Get anyone right you get a taco. (If nobody answered it before). You may only answer at most 2 of them.
I am thinking of a 4-digit number. It is equal to the sum of the squares of it's 2 smallest prime factors, squared, minus 1. Its smallest prime factors multiply up to also be 1 less than a square number.
what is the number?
The measures of the angles in a triangle, in degrees, are three different integers. What is the minimum possible sum of its smallest and largest angles?
HINT: THE ANGLES OF A TRIANGLE ADD UP TO 180First correct answer gets a taco
So I was looking in the Lichess database and I found a really interesting gambit for white in the Sicilian Defence. Please play a few games with this and post them here. Thanks!