Search Results

A variant on lorancou's approach: for each puzzle type, keep an array of (shuffled) puzzle numbers; then every time you hit a puzzle of that type, get the next number off the list. for instance, let's …

While I basically agree with Nathan's answer, I wanted to emphasize that (a) another reason to find all the matches at once is for presentation purposes: it just looks better to blow them all up toget …

My concern with either of the approaches currently offered is that they'll both lead to 'variable-speed' blinking, which could not only be distracting for the players but also make it hard to gauge ex …

Instead, what you want to do is to write an algorithm that searches all possible moves-and-replies for some number of moves ahead (5 to 10 would be typical), evaluates the position at the end of each branch … is often called the Minimax algorithm. …

This breaks into two distinct pieces: testing collisions against the endcaps, and testing collisions against the body of the cylinder. The simplest way to handle both is to first transform your way i …

A few things that come to mind: For the first test you shouldn't really (directly) need any quaternions; you have your AI's heading as a vector (and if you don't, you can quickly derive it from thei …

I guess I'll take the counterpoint here and argue against using static values. In this case, all of the hex regions you're talking about are (a) easy to compute - you don't need to use BFS or anythin …

explicit recursion for the minimax, and instead maintain a stack yourself, and there are plenty of other object-management optimizations that you would want to make for a practical implementation of the algorithm … Still, this code should show the core of the algorithm: to evaluate a position, evaluate all of the subpositions from the current side's point of view, pick the 'best', and return that value. …

Finding connectivity in a general graph is usually done with floodfill-style algorithms (i.e., breadth- or depth- first search and variants thereof) anyway, so I don't think that abstracting out the p …

If you're intending to use only integers then I would give serious consideration to expanding the range from 1000 to something higher; an average of ten units between levels means that you'll either b …

Assuming that you want an actually smooth terrain, I'd suggest stepping back from the noise-based answers and understanding where they come from. A 'noise' signal is essentially a sum of infinitely m …

Bresenham's algorithm is specifically built to draw circles with fixed-point mathematics; that is, to rasterize circles. …

Another straightforward approach is by using your own low-frequency noise to draw (or define) a figure in polar coordinates. Suppose you want a blob centered at the origin, of average radius 1; this …

Another approach would be to start with a distribution that's 'fair' but regular, and then use an appraoch similar to Simulated Annealing to break up the regularity without losing the fairness: Star …