Pewqazz

Hey, I'm the original author of the repo -- I noticed a bunch of stars coming in and figured it was coming from Hacker News, heh.

I should probably go and make it clearer in the README, but you're right, by no means is it a full Enigma implementation. It mostly started as a translation of code described in [this post](http://practicalcryptography.com/ciphers/mechanical-era/enig...) from C to Rust (since I was a naïve undergrad interested in Rust).

At some point it would be cool to add the full Enigma functionality. Do you have any guidance for test cases and/or reference implementations?

Oh wow, earlier this year, a few friends and I built a proof-of-concept of emotion-targetted content delivery in news feeds for a hackathon [1], as a way of warning people that this was plausible. Pretty wild to find out that Facebook actually holds a patent on the very idea that we were toying around with.

[1] https://github.com/nwhacks-loki/loki

I wrote the original Homebrew formula for exa and remembered adding support for the Git-less install, so I was surprised to see it wasn't there anymore! Seems like it was removed in this version bump [1] — I'll open a PR adding it back in.

[1] https://github.com/Homebrew/homebrew-core/pull/13676

Note that this video is of SethBling pulling off the credits warp for the very first time, when the current setup for the warp was unknown. Here is a video of Seth performing the warp that was explained in the posted video, which is faster by over four minutes:

https://www.youtube.com/watch?v=KADhybyjOEo

It's amusing to watch repositories being added in real-time. I'm a fan of the Lucky (777) and Mark of the Beast (666) hash-related achievements.

UBC's introductory CS course (CPSC 110) uses HtDP/2e as its "textbook". Given the progress that the majority of students make throughout the term, I think it's quite successful in terms of teaching the fundamentals, despite not being based on a more "conventional" language like Python or Java.

Thanks for continuing development on Skeleton! My current blog design is largely based on Skeleton 1.x, but it looks like I'll be updating it this week.

It's a visual representation of the most optimal tic-tac-toe strategy based on a given game state. Assume you're playing as X, who goes first. The largest X in the whole figure is in the top-left, indicating that that's X's optimal move. Now, let's say O decided to play in the top-middle square. You would "zoom in" on that ninth of the board; the black X and O represent the fact that this is the current state of the game. There is now a large red X in the middle, so that's where you should play your next move. Repeat until the game is over.

Greg's blog is what inspired me to use Pelican. I'm currently using Travis CI to automatically build and push changes made to files in the source branch to the GitHub Pages branch (see this post [1] for further details).

[1] http://kevinyap.ca/2014/06/deploying-pelican-sites-using-tra...

Awesome, thanks for updating Local Euler! It was unbelievably useful that there were already text-only versions of lots of the puzzles when I started putting together EulerPy. I'll work on adding the rest of them in.

In retrospect, I probably should have contacted you before using Local Euler in this project. Hopefully you don't mind.

Thanks for the kind words. It's fantastic to see people making use of my project!

It would definitely be cool to implement a `--hint` function to complement `--cheat`. However, in order to do so, I would need to find a resource that contained said hints on a per-problem basis.

Alternatively, if there is a generalized list of useful algorithms for Project Euler somewhere out there, it would be trivial to add it to a short "problem hints"-esque section in the readme.

Hmm, I'll have to keep this in mind when I get to adding problems like this. Time to convert GeoGebra images to ASCII art /s!

Ah, I like this idea. I'll look into implementing it.

Edit: I just realized that implementing encryption with respect to the problem answers would imply removing the `--cheat` option. I've started a discussion [1] in the repository's issue tracker about this topic.

[1] https://github.com/iKevinY/EulerPy/issues/3

The solutions that are stored in the package are only plain answers - not actual algorithmic solutions to each of the problems. I understand the concern, but in my opinion, if someone had a collection of solutions that were derived specifically from the answers derived from EulerPy, it would likely consist of just `print n`s (which shouldn't be impressive to anyone by any means). I apologize if my project has degraded the integrity of the Project Euler community.

Good point; I'll keep this solution in mind.

I considered this, and figured since the solutions are stored by the program anyways, it would make more sense to include the functionality rather than to omit it. Naming the option `--cheat` was an conscious decision to discourage a reliance on it. Then again, if someone really does want to view the solutions rather than work through the problems themselves, I suppose it's their loss anyways.

Oh wow, didn't think this would get posted to Hacker News. I only submitted a link to /r/learnprogramming and /r/Python since, being my first ever Python project, it seems pretty rudimentary compared to some of the amazing things I see here. I'm glad to see people are liking it (and perhaps more importantly that I didn't make any massive coding mistakes)!