Search Results

Search found 7220 results on 289 pages for 'graph algorithm'.

Page 7/289 | < Previous Page | 3 4 5 6 7 8 9 10 11 12 13 14  | Next Page >

• How meaningful is the Big-O time complexity of an algorithm?

  - by james creasy

  Programmers often talk about the time complexity of an algorithm, e.g. O(log n) or O(n^2). Time complexity classifications are made as the input size goes to infinity, but ironically infinite input size in computation is not used. Put another way, the classification of an algorithm is based on a situation that algorithm will never be in: where n…

  Read the article

• Checkers AI Algorithm

  - by John

  I am making an AI for my checkers game and I'm trying to make it as hard as possible. Here is the current criteria for a move on the hardest difficulty: 1: Look For A Block: This is when a piece is being threatened and another piece can be moved in behind it to protect it. Here is an example: Black Moves |W| |W| |W| |W| | | |W| |W| |W| |W| |W|…

  Read the article

• C# XNA: Effecient mesh building algorithm for voxel based terrain ("top" outside layer only, non-destructible)

  - by Tim Hatch

  To put this bluntly, for non-destructible/non-constructible voxel style terrain, are generated meshes handled much better than instancing? Is there another method to achieve millions of visible quad faces per scene with ease? If generated meshes per chunk is the way to go, what kind of algorithm might I want to use based on only EVER needing the…

  Read the article

• Which algorithm used in Advance Wars type turn based games

  - by Jan de Lange

  Has anyone tried to develop, or know of an algorithm such as used in a typical turn based game like Advance Wars, where the number of objects and the number of moves per object may be too large to search through up to a reasonable depth like one would do in a game with a smaller search base like chess? There is some path-finding needed to to…

  Read the article

• Can Goldberg algorithm in ocamlgraph be used to find Minimum Cost Flow graph?

  - by Tautrimas

  I'm looking for an implementation to the Minimum Cost Flow graph problem in OCaml. OCaml library ocamlgraph has Goldberg algorithm implementation. The paper called Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm is noting that Goldberg-Tarjan algorithm can find minimum cost graph. Question is, does ocamlgraph…

  Read the article

• Flood fill algorithm for Game of Go

  - by Jackson Borghi

  I'm having a hell of a time trying to figure out how to make captured stones disappear. I've read everywhere that I should use the flood fill algorithm, but I haven't had any luck with that so far. Any help would be amazing! Here is my code: package Go; import static java.lang.Math.*; import static stdlib.StdDraw.*; import…

  Read the article

• FloodFill Algorithm for Game of Go

  - by Jackson Borghi

  I'm having a hell of a time trying to figure out how to make captured stones disappear. I've read everywhere that I should use the FloodFill algorithm, but I havent had any luck with that so far. Any help would be amazing! Here is my code: package Go; import static java.lang.Math.; import static stdlib.StdDraw.; import…

  Read the article

• How to choose a integer linear programming solver ?

  - by Cassie

  Hi all, I am newbie for integer linear programming. I plan to use a integer linear programming solver to solve my combinational optimization problem. I am more familiar with C++/object oriented programming on an IDE. Now I am using NetBeans with Cygwin to write my applications most of time. May I ask if there is an easy…

  Read the article

• What is a good measure of strength of a link and influence of a node?

  - by Legend

  In the context of social networks, what is a good measure of strength of a link between two nodes? I am currently thinking that the following should give me what I want: For two nodes A and B: Strength(A,B) = (neighbors(A) intersection neighbors(B))/neighbors(A) where neighbors(X) gives the total number of nodes…

  Read the article

• What should be contained in a game scene graph?

  - by Bunkai.Satori

  Would you help me to clarify, please, what what exactly should be contained within a game scene graph? See the following list, please: Game Actors? (obviously yes, all the objects changing state should be the major prart of the Scene Graph) Simple static game ojbects? (I mean ojects places in the background that…

  Read the article

• Moving sprites on a graph in libGDX

  - by nosferat

  In my game I'd like to move sprites on a fixed path. Until this point I was trying to stick with the tools already provided by libGDX, like the Tiled map renderer classes so I'm looking for a solution nearly as convenient as that, e.g. I'd like to avoid creating the adjacency matrix by hand. Tiled has the…

  Read the article

• When can I be sure a directed graph is acyclic?

  - by Daniel Scocco

  The definition for directed acyclic graph is this: "there is no way to start at some vertex v and follow a sequence of edges that eventually loops back to v again." So far so good, but I am trying to find some premises that will be simpler to test and that will also guarantee the graph is acyclic. I came…

  Read the article

• .NET implementation of planarity testing

  - by DixonD

  Is there any .NET implementation of any planarity testing algorithm like Boyer-Myrvold's or anyone else? I looked through the web but I didn't manage to find

  Read the article

• Chambers In A Castle Algorithm

  - by 7Aces

  Problem Statement - Given a NxM grid of 1s & 0s (1s mark walls, while 0s indicate empty chambers), the task is to identify the number of chambers & the size of the largest. And just to whet my curiosity, to find in which chamber, a cell belongs. It seems like an ad hoc problem, since the…

  Read the article

• Partial recalculation of visibility on a 2D uniform grid

  - by Martin Källman

  Problem Imagine that we have a 2D uniform grid of dimensions N x N. For this grid we have also pre-computed a visibility look-up table, e.g. with DDA, which answers the boolean query is cell X visible from cell Y? The look-up table is a complete graph KN of the cells V in the grid, with each edge E…

  Read the article

• Merging similar graphs based solely on the graph structure?

  - by Buttons840

  I am looking for (or attempting to design) a technique for matching nodes from very similar graphs based on the structure of the graph*. In the examples below, the top graph has 5 nodes, and the bottom graph has 6 nodes. I would like to match the nodes from the top graph to the nodes in the bottom…

  Read the article

• Algorithm for spreading labels in a visually appealing and intuitive way

  - by mac

  Short version Is there a design pattern for distributing vehicle labels in a non-overlapping fashion, placing them as close as possible to the vehicle they refer to? If not, is any of the method I suggest viable? How would you implement this yourself? Extended version In the game I'm writing…

  Read the article

• AABB Sweeping, algorithm to solve "stacking box" problem

  - by Ivo Wetzel

  I'm currently working on a simple AABB collision system and after some fiddling the sweeping of a single box vs. another and the calculation of the response velocity needed to push them apart works flawlessly. Now on to the new problem, imagine I'm having a stack of boxes which are falling towards…

  Read the article

• Derive a algorithm to match best position

  - by Farooq Arshed

  I have pieces in my game which have stats and cost assigned to them and they can only be placed at a certain location. Lets say I have 50 pieces. e.g. Piece1 = 100 stats, 10 cost, Position A. Piece2 = 120 stats, 5 cost, Position B. Piece3 = 500 stats, 50 cost, Position C. Piece4 = 200 stats, 25…

  Read the article

• Algorithm for approximating sihlouette image as polygon

  - by jack

  I want to be able to analyze a texture in real time and approximate a polygon to represent a silhouette. Imagine a person standing in front of a green screen and I want to approximately trace around their outline and get a 2D polygon as the result. Are there algorithms to do this and are they…

  Read the article

• Best algorithm for recursive adjacent tiles?

  - by OhMrBigshot

  In my game I have a set of tiles placed in a 2D array marked by their Xs and Zs ([1,1],[1,2], etc). Now, I want a sort of "Paint Bucket" mechanism: Selecting a tile will destroy all adjacent tiles until a condition stops it, let's say, if it hits an object with hasFlag. Here's what I have so…

  Read the article

• Algorithm to find average position

  - by Simran kaur

  In the given diagram, I have the extreme left and right points, that is -2 and 4 in this case. So, obviously, I can calculate the width which is 6 in this case. What we know: The number of partitions:3 in this case The partition number at at any point i.e which one is 1st,second or third…

  Read the article

• Algorithm to shift the car

  - by Simran kaur

  I have a track that can be divided into n number of tracks and a car as GamObject. The track has transforms such that some part of the track's width lies in negative x axis and other in positive. Requirement: One move should cross one track. On every move(left or right), I want the car to…

  Read the article

• 2D/Isometric map algorithm

  - by Icarus Cocksson

  First of all, I don't have much experience on game development but I do have experience on development. I do know how to make a map, but I don't know if my solution is a normal or a hacky solution. I don't want to waste my time coding things, and realise they're utterly crap and lose my…

  Read the article

• What's wrong with this turn to face algorithm?

  - by Chan

  I implement a torpedo object that chases a rotating planet. Specifically, it will turn toward the planet each update. Initially my implement was: void move() { vector3<float> to_target = target - get_position(); to_target.normalize(); position +=…

  Read the article

< Previous Page | 3 4 5 6 7 8 9 10 11 12 13 14  | Next Page >