Formula for Human Genius and Creativity High IQ in high demand Intelligence, creativity and genius are generally regarded as highly valuable assets of the human mind. As a strong positive correlation exists between IQ and the median earned income, most people would gladly boost their IQ, improve creativity or accept being called a genius. Exceptions to this rule are few and most revolve around a claim that intelligence may be an obstacle on the way towards universal happiness. high intelligence reveals existential truths and as such is highly depressive high intelligence prevents atavistic enjoyment of relationships high intelligence is a source of envy and other bad feelings in others high intelligence leads to inhuman behaviors and most sophisticated forms of evil In this article, I will tacitly ignore the above claims and assume that you would gladly become more intelligent, creative or innovative. Nature-vs-nurture dilemma resolved Many books on psychology put a substantial emphasis on the nature-vs-nurture debate.
Open Source Matters: 6 Source Code Search Engines You Can Use For Programming Projects The Open source movement is playing a remarkable role in pushing technology and making it available to all. The success of Linux is also an example how open source can translate into a successful business model. Open source is pretty much mainstream now and in the coming years, it could have a major footprint across cutting edge educational technology and aerospace (think DIY drones). Open source projects need all the help they can get. Ohloh Ohloh Code says it is one of the largest and more comprehensive code search engines with more than 10+ billion lines of code indexed and updated FOSS software directories. Krugle Krugle is an open source search portal which taps into open source search repositories like Apache, JavaDocs, and SourceForge among others. SearchCode SearchCode sifts through 16 billion lines of open source code from code repositories like GitHub, BitBucket, CodePlex, SourceForge, Fedora and more. NerdyData Symbol Hound Merobase
7 Python Libraries you should know about In my years of programming in Python and roaming around GitHub's Explore section, I've come across a few libraries that stood out to me as being particularly enjoyable to use. This blog post is an effort to further spread that knowledge. I specifically excluded awesome libs like requests, SQLAlchemy, Flask, fabric etc. because I think they're already pretty "main-stream". If you know what you're trying to do, it's almost guaranteed that you'll stumble over the aforementioned. 1. pyquery (with lxml) pip install pyquery For parsing HTML in Python, Beautiful Soup is oft recommended and it does a great job. Just how slow? What immediately stands out is how fast lxml is. So either slow and easy to use or fast and hard to use, right? Wrong! Enter PyQuery Oh PyQuery you beautiful seductress: from pyquery import PyQuerypage = PyQuery(some_html) last_red_anchor = page('#container > a.red:last') Easy as pie. for paragraph in page('#container > p'): paragraph = PyQuery(paragraph) text = paragraph.text()
THE BIG MODS: List them, stalk them and cuddle them! Post all major mods here. - Skyrim Mods original thread this from the Previous OP:My friend Winterhold Guard told me to post a new thread where it will be constantly updated, but i m not sure what Solitude Guard will say. NONETHELESS, HERE WE GO! Ulfric better give me a pay rise for this, perhaps promote me to legate. Damn dragonborn took all the prizes while i still stand here and guard that windhelm gate. For easy browsing, stalking and exposure to the big Skyrim mods in development. ~if you know of a big mod that is not listed here, let me know. fully finished(or finished but adding more bugfixes and expansions) / some version released / almost at first release / hot in-progress / just starting / hiatus/dead/no news New lands+ big extensions to the vanilla world of skyrim(I think they all include quests and some include many more things) Babylon (dead) Beyond Death Mountain(waiting for status) FalskaarRELEASED!
“I Need Practice Programming”: 49 Ideas for Game Clones to Code So you know a little bit about programming (perhaps you've read the free book, "Invent Your Own Computer Games with Python", a free programming book for beginners whose author shamelessly plugs at every chance) but you want to get better at coding. You can't seem to find any open source projects that are at your level or easy for new people to contribute to. You've gone through a few of the practice problems at Project Euler but you want to create something more substantial, or at least a cool thing you can show your friends. (Not that finding the 31337th prime number isn't cool.) Here's a list of game clone ideas for you to implement. Orisinal Games: The Orisinal website has a great collection of Flash games with very simple mechanics that can be copied. I especially recommend Winter Bells, A Daily Cup of Tea, Bugs, and Hold the Rope! The Wikipedia entry for video game clones also lists some ideas. 1. Download Source: dodger.zip 2. 3. 4. 5. 6. 7. 8. 9.
Tic Tac Toe An Introduction to Artificial Intelligence What is Tic Tac Toe? Tic Tac Toe is simply an awesome game. (Although I do have to say that I really think its original name - noughts and crosses - is a whole lot cooler). It is simple and easy to play wherever you are. There is some debate on where this game originated; theories are ranging from ancient Egypt to the Roman Empire. The Stats One could assume that there are 9! 131,184 (1st player)77,904 (2nd player)46,080 (tie) This might seem like a lot but for a Computer this is a joke. There are 138 terminal positions after assuming symmetries. 91 (player 1)44 (player 2)3 (tie) A little bit of Game Theory Mathematics has a really interesting branch called Game Theory. So how is this important for Tic Tac Toe? Tic Tac Toe is something called a zero-sum game. Perfect Play To develop an AI for Tic Tac Toe it has to be able to decide what to do next. The famous Tic Tac Toe xkcd. (#832) Artificial Intelligence 101 What would a human do? The Setup Minimax #!
Writing a game in Python with Pygame. Part I Introduction Games are one of the most applicative areas of programming. To write even the simplest games, you have to get into graphics, math, physics and even AI. It’s a great and fun way to practice programming. If you’re a fan of Python (and even if you aren’t) and are interested in games, Pygame is a great library for game programming, and you should definitely check it out. It runs on all major platforms, and provides simple tools to manage complex graphical worlds with movement and sounds. There are quite a lot of Pygame tutorials on the web, but most of them are basic. This tutorial explicitly encourages you to tinker with the code. Preliminaries For reasons I’ve mentioned above, this tutorial is not for complete beginners. Here, I assume that you have the following knowledge: Python (you don’t have to be an advanced user, but not a complete beginner either)Basics of math and physics (vectors, rectangles, laws of movement, probability, etc.). Let’s get started The code Pygame’s docs
Divisor function Divisor function σ 0 ( n ) up to n = 250 Sigma function σ 1 ( n ) up to n = 250 Sum of the squares of divisors, σ 2 ( n ), up to n = 250 Sum of cubes of divisors, σ 3 ( n ) up to n = 250 In mathematics , and specifically in number theory , a divisor function is an arithmetic function related to the divisors of an integer . A related function is the divisor summatory function , which, as the name implies, is a sum over the divisor function. Definition [ edit ] The sum of positive divisors function σ x ( n ), for a real or complex number x , is defined as the sum of the x th powers of the positive divisors of n . where is shorthand for " d divides n ". The aliquot sum s(n) of n is the sum of the proper divisors (that is, the divisors excluding n itself, A001065 ), and equals σ 1 ( n ) − n ; the aliquot sequence of n is formed by repeatedly applying the aliquot sum function. Example [ edit ] For example, σ 0 (12) is the number of the divisors of 12: while σ 1 (12) is the sum of all the divisors: and
Two-Tiered A* Pathfinding In my main article, A* Pathfinding for Beginners, I described A* in very general terms, and described how to create a single all-purpose pathfinding function. Creating only one pathfinding function, however, can be needlessly limiting. Consider the following RPG situation, and a swordsman who wants to pathfind around a nearby wall: Given this kind of map, you could place nodes in a variety of ways, and use a variety of densities. In this example, let's use a high-density node network, as is shown below. In this graphic, the white nodes are walkable. As you can see, using this tightly packed node network, we can pathfind not only around the nearby wall but also between the wall and the nearby barrel in the process. Well, that is pretty cool in short-distance situations, but what do we do if we need to pathfind across the entire map? So let's look at an alternative. In this example, the nodes are in the center of the large isometric diamonds. Putting the Two Together Well, that's it.
A* Pathfinding for Beginners By Patrick Lester (Updated July 18, 2005) This article has been translated into Albanian, Chinese, Finnish, German, Greek, Korean, Polish, Portuguese, Romanian, Russian, Serbian, and Spanish. Other translations are welcome. See email address at the bottom of this article. The A* (pronounced A-star) algorithm can be complicated for beginners. While there are many articles on the web that explain A*, most are written for people who understand the basics already. This article does not try to be the definitive work on the subject. Finally, this article is not program-specific. But we are getting ahead of ourselves. Introduction: The Search Area Let’s assume that we have someone who wants to get from point A to point B. [Figure 1] The first thing you should notice is that we have divided our search area into a square grid. These center points are called “nodes”. Starting the Search We begin the search by doing the following: [Figure 2] Path Scoring where H can be estimated in a variety of ways. 1.
Allegro - A game programming library - Multiplayer Game Programming for Teens with Python: Part 1 If you're new here, you may want to subscribe to my RSS feed or follow me on Twitter. Thanks for visiting! Learn how to make a multiplayer game with Python! This is a post by Tutorial Team Member Julian Meyer, a 13-year-old python developer. You can find him on Google+ and Twitter. I’m sure that once in a while, you and your friends go online to play a multiplayer game. In this tutorial, you will learn about multiplayer game programming by creating a sample game. For this tutorial, you will be using Python and the PyGame modules. Getting Started The first step is to make sure that you have PyGame installed. You can also download and install PyGame in these ways: With MacPorts using: sudo port install python2.7 py27-gameWith Fink using: sudo fink install python27 pygame-py27With Homebrew and pip using the command found here. If you are running Windows, then you can find your installer here. The Rules of the Game The game you’re going to make in this tutorial is called “Boxes”. That’s it. Wow!