Home | Gaming | Programming | Play Online | Contact | Keyword Query
Games++ Games & Game Programming


Web Games++

Cheat Codes
Trickster Wiki
Game Ratings
Gameboy Cheats
PlayStation Cheats
BlackBerry Games
Learn It 2
Photoshop Tutorials
Illustrator Tutorials
ImageReady Tutorials



Artificial Intelligence | Collision Detection | Compression
Data Trees | Graphics | Miscellaneous | Path Finding | Sorting

Artificial Intelligence (AI) Algorithms
view article Uncertainty in Artificial Intelligence
A complicated challenge for artificial intelligence since its inception has been knowledge representation in problems with uncertain domains. What a system can't see is, nonetheless, of possible importance to its reasoning mechanisms. What is unknown is also often still vital to common sense reasoning. This posting will hopefully publicise Bayesian networks, which provide a formalism for modelling and an inference mechanism for reasoning under uncertainty and initiate discussion about uncertainty problems and probabilistic reasoning in game AI's.
Compression Algorithms
view article Huffman Compression
Huffman Compression, also known as Huffman Encoding, is one of many compression techniques in use today. Others are LZW, Arithmetic Encoding, RLE and many many more. One of the main benefits of Huffman Compression is how easy it is to understand and impliment yet still gets a decent compression ratio on average files.
view article Image Compression with Vector Quantization
Until we start seeing games with a serious amount of geometry, the greatest slice of the memory pie will belong to textures. The hundreds of megabytes of stuff coming from the art quarters must be compressed. Conventional image-compression algorithms are not very well suited to the specific requirements of art storage in games. This article provides an introduction to the field of VQ, presents two algorithms for performing VQ, and goes into the details of a successful real-world application for VQ texture compression.
view article Compression Algorithms FAQ - Part 1
This file is part 1 of a set of Frequently Asked Questions (FAQ) for the groups comp.compression and comp.compression.research.
view article Compression Algorithms FAQ - Part 2
This file is part 2 of a set of Frequently Asked Questions for the groups comp.compression and comp.compression.research.
view article Compression Algorithms FAQ - Part 3
This file is part 3 of a set of Frequently Asked Questions for the groups comp.compression and comp.compression.research.
Data Trees Algorithms
view article Balanced Binary Tree
This article gives a brief, non-academic (i.e. no dwelling into time complexity issues), explanation of what binary trees are about. It also provide source and demo of a generic tree class. Functionality to balance the tree is also described/provided.
view article Binary Space Partitioning (BSP) Trees
This article explains how BSP (binary space partitioning) trees can be used in a game such as DOOM as part of the rendering pipeline to perform back-face culling, partial Z-ordering and hidden surface removal.
view article Trees Part 2: Binary Trees
Extensively covers binary trees, including binary search trees, and how to work with them. by Ron Penton
Graphics Programming Algorithms
view article Generating a List of 3D Triangles
By Kimberley Burchett. I got a lot of letters asking for a copy of my post on connecting points into a shape. So, instead of mailing a bunch of letters, I'm going to just post it here.
view article Graphics Algorithms
A plethora of information.
Miscellaneous Programming Algorithms
view article A Painless Guide To CRC Error Detection Algorithms
Everything you wanted to know about CRC algorithms, but were afraid to ask for fear that errors in your understanding might be detected.
view article Gravity in your game?
Here's How! The information contained in document will allow you to realistically simulate jumping and interstellar maneuvers.
view article Information on Hex Grids Algorithms
Here's a hexagonal grid with a coordinate system mapped to square grids. Note that this is just one possible orientation of the hexagons---if you change it so hexes are adjacent horizontally instead of vertically, you get a symmetric situation.
view article Mouse Hits Over a Hexagon Grid
The idea is to assume first that if the mouse landed in a rectangle, then it landed in hexagon and then correct if the mouse position is in one of the two triangular flaps.


PC Game Ratings
PS3 Ratings
Wii Ratings
Xbox 360 Ratings
PS2 Ratings
Xbox Ratings
Gamecube Ratings
PSP Ratings
NDS Ratings
GBA Ratings
Release Dates


Copyright © 1998-2008, Games++ All rights reserved. | Privacy Policy