Perceptrons

Introduction to Data Trees
A brief and easy-to-understand explanation of the concepts behind data trees, reasons to use them, and how they work. Easy to understand diagrams are used.

Introduction to General Artificial Intelligence
The basic ideas behind the field of Artificial Intelligence and an explanation of some of the various movements within AI that have struggled to make their ideas known.

Introduction to Chess Artificial Intelligence
A to-the-point article about how Chess AI has developed, and then a defense about why Chess AI is still useful to AI research.

Introduction to Go Artificial Intelligence
An introduction to the AI of Go, an Asian strategy board game so vast and deep that traditional AI techniques (such as the Minimax tree) do not work. Even humans rely heavily on such vague concepts as "intuition," yet even beginners can beat the best computers. Thus, this game is a fertile testing ground for the latest AI techniques, such as neural networks, genetic algorithms, and visual parsing.

 
Minimax

Introduction to Data Trees
A brief explanation of the concepts behind data trees, reasons to use them, and how they work. Diagrams make this essay easy to understand and follow.

Heap Trees and Heap Sort
A full explanation of what a heap tree is, how it is implemented in C++, and how to use it for heap sort, one of the fastest sorting algorithms ever created. A must-know for anyone who programs.

2-3 Trees
The 2-3 tree is a wonderfully speedy improvement over the traditional binary tree. This tree can become complicated, but this essay makes all of the concepts intuitive and easy to understand.

Binary Search Trees
Binary search trees, or just binary trees, are one of the basic buildings blocks to programming. This essay makes it easy to understand and program this essential topic.

Introduction to Chess Artificial Intelligence
A to-the-point article about how Chess AI has developed, and then a defense about why Chess AI is still useful to AI research.

Chess Board Representation
One of the crucial factors to consider in making a chess program is how to represent the board, because this choice influences the structures and algorithms of all of the other parts of the program. This essay explains a wide variety of possible ways to represent a chess board, and the pros and cons of each.

Chess Board Representation

Introduction to Chess Artificial Intelligence
A to-the-point article about how Chess AI has developed, and then a defense about why Chess AI is still useful to AI research.

Minimax Game Trees
The minimax tree is so successful in AI that almost every traditional board game program implements this in one form or another, from chess and checkers to reversi and backgammon. This simple essay explains how a minimax tree is structured and how to use one.

Efficiency and the Space-Time Continuum
Programming efficiently is often a balancing act between speed (Time) and resources (Space). This essay explains some of the different ideas to consider when doing this balancing act. Such knowledge is crucial for all sorts of occupations including network administration, program writing, and game writing.