Program ideas please!

[LukaP]

for a quick challenge. Say you have a graph of n points in cartesian. now find the shortest path to cover them all (its not nearest neighbour)

[Nineshadow]

What you could teach, although they aren't exactly programs by themselves:

data structures

sorting algorithms

graphs

etc.

 

Another idea :

Maybe a snake game? I tried it myself recently and it works really well with OOP.

http://linustechtips.com/main/topic/472371-snake-game-in-c-and-sfml/

That's going to take more than half an hour probably.

[I need a better name]

But... Thats already been done! Its called STEAM!

yes, but this program can do it EVEN FASTER!

[LightCode Gaming]

for a quick challenge. Say you have a graph of n points in cartesian. now find the shortest path to cover them all (its not nearest neighbour)

I'd have to do test cases of 14 or less ._. 15 goes to a 7 min run time (if I remember correctly)

[LightCode Gaming]

What you could teach, although they aren't exactly programs by themselves:

data structures

sorting algorithms

graphs

etc.

 

Another idea :

Maybe a snake game? I tried it myself recently and it works really well with OOP.

http://linustechtips.com/main/topic/472371-snake-game-in-c-and-sfml/

That's going to take more than half an hour probably.

I actually wanted to do pong earlier, but then I realized I need hit detection, which I don't know yet (Still taking computer graphics).

[LightCode Gaming]

yes, but this program can do it EVEN FASTER!

... Lord Gaben help us all *cowers in fear*

[LukaP]

I'd have to do test cases of 14 or less ._. 15 goes to a 7 min run time (if I remember correctly)

well if you do it smart, its only O(n²2ⁿ)... bruteforcing is O(n!)

[LightCode Gaming]

well if you do it smart, its only O(n²2ⁿ)... bruteforcing is O(n!)

Funny you mention this though...

I've been thinking about ways to "beat" nearest neighbor... Currently have something that MIGHT work, but has double the run time of NN. (n^2-n)/2 VS n^2-n

But, from the hand drawn tests I've done, it gets the same route OR better. Never worse. Mind you, I've only done test cases with up to 8 nodes because doing 10 nodes by hand is horrid with the method I'm using.

[Azgoth 2]

Hm...the fractal one could be cool (it's not super hard to do a Koch snowflake if you're reasonably handy with graphs--it's very easy to do with recursion).  I've done that very thing in Python, but it would be cool to see it done in C++ for comparison.

 

A random walk generator in N dimensions, capable of doing multiple walks, and plotting them all over each other as A) actual paths and/or B) a heatmap, color-coded by how often a point was visited by any of the walks.  And then, maybe, a random walk that's weighted so it tends towards, say, a ring or a circle or the like.

[LightCode Gaming]

Hm...the fractal one could be cool (it's not super hard to do a Koch snowflake if you're reasonably handy with graphs--it's very easy to do with recursion).  I've done that very thing in Python, but it would be cool to see it done in C++ for comparison.

 

A random walk generator in N dimensions, capable of doing multiple walks, and plotting them all over each other as A) actual paths and/or B) a heatmap, color-coded by how often a point was visited by any of the walks.  And then, maybe, a random walk that's weighted so it tends towards, say, a ring or a circle or the like.

Fractal will probably be done in the future.

Not sure what you are suggesting in the second part aside from the heat-map side of it.

[Nineshadow]

I actually wanted to do pong earlier, but then I realized I need hit detection, which I don't know yet (Still taking computer graphics).

Snake is really simple and straight-forward.

[LightCode Gaming]

Snake is really simple and straight-forward.

Aside from the fact that I don't have hit detection yet <.<

[Nineshadow]

Aside from the fact that I don't have hit detection yet <.<

You don't need hit detection for snake.

[LightCode Gaming]

You don't need hit detection for snake.

Walls? Eating the "food"?

I know a way to go around that, but hit-detection would make it so much easier.

[Nineshadow]

Walls? Eating the "food"?

I know a way to go around that, but hit-detection would make it so much easier.

Just forward-check the position before moving.

Calculate new position from player inputIf the new position is already occupied by a wall or another snake element , then it's game over.Otherwise: 1.if the new position is occupied by food , then you need to increment the size of the snake and generate a new piece of food.2.Move to the new position

[LightCode Gaming]

 

Just forward-check the position before moving.

Calculate new position from player inputIf the new position is already occupied by a wall or another snake element , then it's game over.Otherwise: 1.if the new position is occupied by food , then you need to increment the size of the snake and generate a new piece of food.2.Move to the new position

True, but I doubt with my currently limited knowledge that I'd be able to do snake in <30 mins.

[Nineshadow]

True, but I doubt with my currently limited knowledge that I'd be able to do snake in <30 mins.

Unless you plan ahead, probably no.

[LightCode Gaming]

Unless you plan ahead, probably no.

Thing is, aside from pre-defined commands, No code is to be written before hand.

[Azgoth 2]

Fractal will probably be done in the future.

Not sure what you are suggesting in the second part aside from the heat-map side of it.

Ah, then let's see if I can make a bit more sense.

 

A program that plots a series of random walks in, say, two dimensions.  (Random walk = start at a given location, then take a step of some size in a random direction, rinse and repeat.  in 2D, this usually is taken to mean "move one step up/down/left/right"; usually, this is implemented by starting with an X and Y value of 0 and 0, then randomly selecting one of them and either adding or subtracting 1, then repeating on the new X and Y values).  A program that does a random walk, starting at (0,0), and then plots it, can make some interesting shapes if you make it do a lot of steps.  Then, if you do multiple random walks--one after another--and plot all of them at the same time, you can get yet another pretty cool looking plot out of it for a large number of steps.  Plotting a heatmap of a few walks, rather than plotting them as lines/paths, ends up looking kind of like a galaxy or big old cluster of stars if you do a grayscale colormap.  Then you can think about "weighting" it so that steps in some directions are more likely given some condition, e.g., a step downwards becomes more likely than a step upwards if the current point's Y value is higher than some pre-defined value.

 

If that still makes no sense, then don't worry about it.  It's admittedly just as much a math problem/application as it is a coding one, but that's the sort of stuff I love doing with programming.  (I've done something similar in Python, like with the Koch snowflake, and would just be interested to see how a C++ program compares).  But, there's a reasonable chance it'll spiral out of hand, so take it as more of a light suggestion than a serious request.

[dannytech357]

Cryptogram game?

[Nineshadow]

Thing is, aside from pre-defined commands, No code is to be written before hand.

Not the code , rather how to do things. Like...what is the snake? It's basically a list/vector of "elements". Ok then , what should each element hold? Its position and a texture/color/shape. Anyway, this is if you do it object oriented.

[LightCode Gaming]

Ah, then let's see if I can make a bit more sense.

 

A program that plots a series of random walks in, say, two dimensions.  (Random walk = start at a given location, then take a step of some size in a random direction, rinse and repeat.  in 2D, this usually is taken to mean "move one step up/down/left/right"; usually, this is implemented by starting with an X and Y value of 0 and 0, then randomly selecting one of them and either adding or subtracting 1, then repeating on the new X and Y values).  A program that does a random walk, starting at (0,0), and then plots it, can make some interesting shapes if you make it do a lot of steps.  Then, if you do multiple random walks--one after another--and plot all of them at the same time, you can get yet another pretty cool looking plot out of it for a large number of steps.  Plotting a heatmap of a few walks, rather than plotting them as lines/paths, ends up looking kind of like a galaxy or big old cluster of stars if you do a grayscale colormap.  Then you can think about "weighting" it so that steps in some directions are more likely given some condition, e.g., a step downwards becomes more likely than a step upwards if the current point's Y value is higher than some pre-defined value.

 

If that still makes no sense, then don't worry about it.  It's admittedly just as much a math problem/application as it is a coding one, but that's the sort of stuff I love doing with programming.  (I've done something similar in Python, like with the Koch snowflake, and would just be interested to see how a C++ program compares).  But, there's a reasonable chance it'll spiral out of hand, so take it as more of a light suggestion than a serious request.

I kinda like that idea!

[LightCode Gaming]

Cryptogram game?

Examples?

[LightCode Gaming]

Not the code , rather how to do things. Like...what is the snake? It's basically a list/vector of "elements". Ok then , what should each element hold? Its position and a texture/color/shape. Anyway, this is if you do it object oriented.

I'll think about it.