A token starts at location (0,0) on an infinite grid. On turn $n$ it must jump $n$ units horizontally or vertically, in one of four directions. What is the least number of turns needed for it to reach the location (10,10)? Bonus: what about location (100,100)? Good luck!
On the island of knights and knaves (where knights always tell the truth and knaves lie), you meet two islanders named Penny and Quinru.
Penny: Both Quinru and I are knaves!
Who is a knight and who is a knave?
What am I?
With thieves I consort,
With the Vilest, in short,
I'm quite at ease in depravity,
Yet all divines use me,
And savants can't lose me,
For I am the century of gravity.
I know how to solve a Rubik $4\times4\times4$ or $5\times5\times5$ or bigger, but I have problem with a specific algorithm: the parity error.
What's the shortest parity algorithm for $n\times n\times n$, or is there a really easy way to memorize parity?
Custom Fonts User Script: Revert or Improve the Font Updates
(Stack Apps)
For those of you who prefered the old appearance, or would like a different font to appear in code blocks or across the site as a whole, Custom Fonts is a user script I wrote this morning to allow just that.
Features
Custom...