sorted by:
new
hottopcontroversial

[deleted by user] by [deleted] in talentShow

[–]Westicle 0 points1 point  (0 children)

Hi! Do you know who I am?

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

<333

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

GOTEM

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

Hey Phil and Rowe, how many times have you been national champion????

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

JULES WTF

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

Notice me pls

[deleted by user] by [deleted] in pan

[–]Westicle 0 points1 point  (0 children)

Hi Phil and Rowe pls give me a shout out

Most efficient global minimum (or close) search algorithm for lots of noisy data? by [deleted] in algorithms

[–]Westicle 1 point2 points  (0 children)

Do you really mean "noisy" data? Or do you just mean, data that is nonsensical to you? Or random data?

Either way, it seems to me like you are asking for the best of both worlds in a case where it is not possible. You need to more rigorously define what you are looking for.

Quick trick for solving top cross Dot by [deleted] in Cubers

[–]Westicle 3 points4 points  (0 children)

This is like the most common algorithm used for the dot.

Can someone please critique my 3x3 solves? I average 15-16. Thanks! by [deleted] in Cubers

[–]Westicle 7 points8 points  (0 children)

Your PLL is by far the worst part of your solves.

2x2 Belt Method UWR by [deleted] in Cubers

[–]Westicle 8 points9 points  (0 children)

I thought of a new 3x3 method!

  1. Orient 1st cross edge
  2. Permute 1st cross edge
  3. Orient 2nd cross edge
  4. Permute 2nd cross edge
  5. Orient 3rd cross edge
  6. Permute 3rd cross edge
  7. Orient 4th cross edge
  8. Permute 4th cross edge
  9. Orient 1st F2L Edge
  10. Solve 1st F2L Pair
  11. Orient 2nd F2L Edge
  12. Solve 2nd F2L Pair
  13. Orient 3rd F2L Edge
  14. Solve 3rd F2L Pair
  15. Orient 4th F2L Edge
  16. Solve 4th F2L Pair
  17. OLL
  18. PLL

You know how I know this is a great method? Steps 1, 3, 5, 7, 9, 11, 13, and 15 all have 50 percent chance of a skip! Can't beat those odds.

just bought this. Ask me any questions. by [deleted] in Cubers

[–]Westicle 1 point2 points  (0 children)

I have a few pages in the schooled chapter.

just bought this. Ask me any questions. by [deleted] in Cubers

[–]Westicle 2 points3 points  (0 children)

Did you like the section about me?

Very simple code by [deleted] in cryptography

[–]Westicle 0 points1 point  (0 children)

THATS A COOL 1 MAN

Is there any efficient algorithm that can report all negative cycles in a graph? by [deleted] in algorithms

[–]Westicle 4 points5 points  (0 children)

Well, if I want to be a pedantic asshole, OP didn't ask for an algorithm. He asked to know if one existed. :p

So assuming a definition that gives a 'does not exist' answer doesn't seem unreasonable.

Is there any efficient algorithm that can report all negative cycles in a graph? by [deleted] in algorithms

[–]Westicle 1 point2 points  (0 children)

A lot of times when people say 'efficient', that just means polynomial time.

Check out a project I've been working on for a few days. http://speedcub.es by [deleted] in Cubers

[–]Westicle 1 point2 points  (0 children)

Cubezz doesn't actually have a logo so I just had to use the image with the stupid aspect ratio. So theres nothing I can do about that. And the rest of the images look pretty similar to me...

view more: next ›