bq. Note: You should probably consider using java.lang.Thread instead of javax.swing.Timer.
...why?
The Swing timer is far better for people new to programming, because it means you can just ignore threads and synchronization entirely. If you stick with the Swing timer, you can code it in much the same way as you would in Flash and it will just work - if you use threads or the Timer class in java.util, you have to keep in mind that anything you ask it to do will be executed on a separate thread, and it _will_ trip you up if you ignore synchronization.
<blockquote>
<p>Note: You should probably consider using java.lang.Thread instead of javax.swing.Timer.</p>
</blockquote>
<p>…why?</p>
<p>The Swing timer is far better for people new to programming, because it means you can just ignore threads and synchronization entirely. If you stick with the Swing timer, you can code it in much the same way as you would in Flash and it will just work – if you use threads or the Timer class in java.util, you have to keep in mind that anything you ask it to do will be executed on a separate thread, and it <em>will</em> trip you up if you ignore synchronization.</p>
2009-11-21T00:45:22-08:00
0
true
4
1481424
13
65302
2009-11-21T00:46:12-08:00
46968
bq. to make sure the hardware runs they use a unix-based operating system, not unlike other unix-based operating systems like BSD or freeBSD.
Just because something is based on UNIX doesn't mean it automagically is compatible with everything. In fact, with MacOS it is the exact opposite.
MacOS is only really built to be compatible with the specific hardware that Apple puts in its computers - this allows them to ratchet up the price of the hardware significantly, and customers are forced to suck it up because there is no competition in terms of mac-compatible components.
Windows gets around the compatibility problem by allowing hardware vendors to write drivers and plug them in to the system - Apple doesn't allow that to happen.
<blockquote>
<p>to make sure the hardware runs they use a unix-based operating system, not unlike other unix-based operating systems like <span class="caps">BSD</span> or freeBSD.</p>
</blockquote>
<p>Just because something is based on <span class="caps">UNIX</span> doesn’t mean it automagically is compatible with everything. In fact, with MacOS it is the exact opposite.</p>
<p>MacOS is only really built to be compatible with the specific hardware that Apple puts in its computers – this allows them to ratchet up the price of the hardware significantly, and customers are forced to suck it up because there is no competition in terms of mac-compatible components.</p>
<p>Windows gets around the compatibility problem by allowing hardware vendors to write drivers and plug them in to the system – Apple doesn’t allow that to happen.</p>
2009-11-20T19:15:49-08:00
0
true
9
1480900
166
5519
2009-11-20T19:15:49-08:00
46968
If you feel another user or moderator is breaking the rules, use the link on their profile to report them. That's what it's there for.
<p>If you feel another user or moderator is breaking the rules, use the link on their profile to report them. That’s what it’s there for.</p>
2009-11-20T12:54:12-08:00
0
true
1
1479624
8
65624
2009-11-20T12:54:29-08:00
46968
bq. Getting late, I’m an east coaster (USA). So from wherever I (speaking as the sandbag) have been inserted, go left, pushing everything I find into list, until I am outside of the rangeOffset or I encounter NULL. Then go right, doing the same. That’s the way I thought of it, but could never figure out the code to do it.
I'm not sure this is the best way to handle it :/
Firstly, you ignore everything above you (which you could very well be touching).
Secondly, if it turns out you're not touching anything, you have to do an insert/rebalance followed by a delete/rebalance - which takes time.
Unless your game design requires the player be able to drop two directly on top of each other and have them remain (despite being separate from everything else), you're better off not putting duds in the tree at all - first walk (the relevant subset of) the tree to determine whether they're touching, and only add them to the tree if they are.
<blockquote>
<p>Getting late, I’m an east coaster (<span class="caps">USA</span>). So from wherever I (speaking as the sandbag) have been inserted, go left, pushing everything I find into list, until I am outside of the rangeOffset or I encounter <span class="caps">NULL</span>. Then go right, doing the same. That’s the way I thought of it, but could never figure out the code to do it.</p>
</blockquote>
<p>I’m not sure this is the best way to handle it :/</p>
<p>Firstly, you ignore everything above you (which you could very well be touching).<br />
Secondly, if it turns out you’re not touching anything, you have to do an insert/rebalance followed by a delete/rebalance – which takes time.</p>
<p>Unless your game design requires the player be able to drop two directly on top of each other and have them remain (despite being separate from everything else), you’re better off not putting duds in the tree at all – first walk (the relevant subset of) the tree to determine whether they’re touching, and only add them to the tree if they are.</p>
2009-11-20T01:26:21-08:00
0
true
4
1478801
21
65370
2009-11-20T01:26:21-08:00
46968
bq. But that is a full in-order traversal of the tree isn’t it?
Look at the code again. You don't traverse a subtree if the entirety of it is going to be outside your desired range.
<blockquote>
<p>But that is a full in-order traversal of the tree isn’t it?</p>
</blockquote>
<p>Look at the code again. You don’t traverse a subtree if the entirety of it is going to be outside your desired range.</p>
2009-11-19T23:34:35-08:00
0
true
4
1478703
19
65370
2009-11-19T23:34:35-08:00
46968
Here's a quick search algorithm (psuedocode)
<pre>function TreeSearch(Node n, int lower, int upper) {
List l = new list();
if(lower <= n.value <= upper)
l.add(n);
if(lower <= n.value)
l.add(TreeSearch(n.left, lower, upper));
if(n.value <= upper)
l.add(TreeSearch(n.right, lower, upper));
return l;
}</pre>
You'd call it like follows (assuming a uniform bag width):
<pre>TreeSearch(Tree.head, bag.x - bag.width, bag.x + bag.width);</pre>
followed by checking the y values of the stuff in the returned list.
<p>Here’s a quick search algorithm (psuedocode)</p>
<pre>function TreeSearch(Node n, int lower, int upper) {
List l = new list();
if(lower <= n.value <= upper)
l.add(n);
if(lower <= n.value)
l.add(TreeSearch(n.left, lower, upper));
if(n.value <= upper)
l.add(TreeSearch(n.right, lower, upper));
return l;
}</pre>
<p>You’d call it like follows (assuming a uniform bag width):</p>
<pre>TreeSearch(Tree.head, bag.x - bag.width, bag.x + bag.width);</pre>
<p>followed by checking the y values of the stuff in the returned list.</p>
2009-11-19T22:56:26-08:00
0
true
4
1478666
17
65370
2009-11-19T22:56:26-08:00
46968
How I would handle it:
Have some variable that is constantly being incremented by <code>somenumber</code>.
When it reaches <code>targetnumber</code>, spawn an enemy.
You can linearly increase <code>somenumber</code> as time goes by for an increase in difficulty that doesn't get too excessive.
<p>How I would handle it:</p>
<p>Have some variable that is constantly being incremented by <code>somenumber</code>.</p>
<p>When it reaches <code>targetnumber</code>, spawn an enemy.</p>
<p>You can linearly increase <code>somenumber</code> as time goes by for an increase in difficulty that doesn’t get too excessive.</p>
2009-11-19T22:47:03-08:00
0
true
4
1478659
2
65572
2009-11-19T22:47:03-08:00
46968
bq. Wouldn’t that only work if collision detection means having exactly the same horizontal position? Two sandbags could be in contact without having exactly the same x value
It doesn't matter.
If we know that Sandbag X is to the left of the sandbag of interest, then we can eliminate the entire tree to the left of Sandbag X.
Similarly, if we find some Sandbag Y that is to the right of the sandbag of interest, we can eliminate the entire tree to the right of that.
You're cutting your hittests down to a very small fraction of the entire tree.
<blockquote>
<p>Wouldn’t that only work if collision detection means having exactly the same horizontal position? Two sandbags could be in contact without having exactly the same x value</p>
</blockquote>
<p>It doesn’t matter.</p>
<p>If we know that Sandbag X is to the left of the sandbag of interest, then we can eliminate the entire tree to the left of Sandbag X.</p>
<p>Similarly, if we find some Sandbag Y that is to the right of the sandbag of interest, we can eliminate the entire tree to the right of that.</p>
<p>You’re cutting your hittests down to a very small fraction of the entire tree.</p>
2009-11-19T22:11:17-08:00
0
true
4
1478617
15
65370
2009-11-19T22:11:32-08:00
46968
bq. Since you are traversing through all the sandbags for the collision detection, it is O(n) for all of your data structures.
Indeed. It would be _much_ better to use the binary tree, sort it by (say) horizontal position, and then you've cut it down to O(log n) when testing for collisions.
<blockquote>
<p>Since you are traversing through all the sandbags for the collision detection, it is O(n) for all of your data structures.</p>
</blockquote>
<p>Indeed. It would be <em>much</em> better to use the binary tree, sort it by (say) horizontal position, and then you’ve cut it down to O(log n) when testing for collisions.</p>
2009-11-19T21:23:36-08:00
0
true
4
1478568
12
65370
2009-11-19T21:23:36-08:00
46968
You look at the documentation.
http://java.sun.com/javase/6/docs/api/javax/swing/Timer.html
<p>You look at the documentation.</p>
<p><a href="http://java.sun.com/javase/6/docs/api/javax/swing/Timer.html">http://java.sun.com/javase/6/docs/api/javax/swing/Timer.html</a></p>
2009-11-19T21:20:36-08:00
0
true
4
1478566
10
65302
2009-11-19T21:20:36-08:00
46968
bq. 1. Store the info in a database and retrieve it over the internet whenever card info is needed.
I would suggest instead storing the information in a database, and retrieving it all when the game starts up. Alternatively, request each particular card when it's needed, and cache it so that if it's needed again in the same session, the game doesn't have to retrieve it again.
<blockquote>
<p>1. Store the info in a database and retrieve it over the internet whenever card info is needed.</p>
</blockquote>
<p>I would suggest instead storing the information in a database, and retrieving it all when the game starts up. Alternatively, request each particular card when it’s needed, and cache it so that if it’s needed again in the same session, the game doesn’t have to retrieve it again.</p>
2009-11-19T11:11:15-08:00
0
true
4
1476746
2
65493
2009-11-19T11:11:15-08:00
46968
bq. Collision detection between the newly arrived bag and 325 previously landed bags. That means traversing an array with 325 bags in it.
That seems pretty insignificant. If you're not doing anything fancy, that's only a little over a thousand comparisons, which should be fine to do in the routine which actually places the sandbag.
<blockquote>
<p>Collision detection between the newly arrived bag and 325 previously landed bags. That means traversing an array with 325 bags in it.</p>
</blockquote>
<p>That seems pretty insignificant. If you’re not doing anything fancy, that’s only a little over a thousand comparisons, which should be fine to do in the routine which actually places the sandbag.</p>
2009-11-19T11:08:18-08:00
0
true
4
1476742
6
65370
2009-11-19T11:08:18-08:00
46968
bq. My friend… there are no terrible combos…
Yes there are.
bq. It is possible to drop 30+ plus mana of any color on turn three
That is an example of a _good_ combo. There are plenty of ways to kill once you've got that (like, a single Dragonstorm or Tendrils, because your storm count will easily be sufficient at that point). Trying to use it to power a terrible combo is a pretty big waste.
bq. Also… You want an Auto win? How does this float your boat…
You're using Dark Ritual. That restricts you to Eternal formats, in which a big monster on turn two isn't really much of a threat.
<blockquote>
<p>My friend… there are no terrible combos…</p>
</blockquote>
<p>Yes there are.</p>
<blockquote>
<p>It is possible to drop 30+ plus mana of any color on turn three</p>
</blockquote>
<p>That is an example of a <em>good</em> combo. There are plenty of ways to kill once you’ve got that (like, a single Dragonstorm or Tendrils, because your storm count will easily be sufficient at that point). Trying to use it to power a terrible combo is a pretty big waste.</p>
<blockquote>
<p>Also… You want an Auto win? How does this float your boat…</p>
</blockquote>
<p>You’re using Dark Ritual. That restricts you to Eternal formats, in which a big monster on turn two isn’t really much of a threat.</p>
2009-11-18T21:44:37-08:00
0
true
3
1475967
17
65303
2009-11-18T21:45:06-08:00
46968
Is this useful? You can use it to quickly grab a list of all the badges a user has.
http://www.kongregate.com/forums/4-programming/topics/58167-new-json-feed-of-badge-info
<p>Is this useful? You can use it to quickly grab a list of all the badges a user has.</p>
<p><a href="http://www.kongregate.com/forums/4-programming/topics/58167-new-json-feed-of-badge-info">http://www.kongregate.com/forums/4-programming/topics/58167-new-json-feed-of-badge-info</a></p>
2009-11-18T21:34:27-08:00
0
true
1
1475944
2
65439
2009-11-18T21:35:03-08:00
46968
You can use <a href="http://livedocs.adobe.com/flash/9.0/ActionScriptLangRefV3/flash/display/BitmapData.html#copyPixels%28%29"><code>BitmapData.copyPixels()</code></a> to copy part of an image into a new bitmap.
<p>You can use <a href="http://livedocs.adobe.com/flash/9.0/ActionScriptLangRefV3/flash/display/BitmapData.html#copyPixels%28%29"><code>BitmapData.copyPixels()</code></a> to copy part of an image into a new bitmap.</p>
2009-11-18T21:30:08-08:00
0
true
4
1475939
4
65437
2009-11-18T21:30:21-08:00
46968
bq. <code>variables.dataFormat = URLLoaderDataFormat.VARIABLES;</code>
You seem confused.
<code>URLVariables</code> and <code>URLLoader</code> are two very different things.
<blockquote>
<p><code>variables.dataFormat = URLLoaderDataFormat.VARIABLES;</code></p>
</blockquote>
<p>You seem confused.</p>
<p><code>URLVariables</code> and <code>URLLoader</code> are two very different things.</p>
2009-11-18T21:12:26-08:00
0
true
4
1475908
3
65412
2009-11-18T21:12:26-08:00
46968
bq. I’m making a tower defence game and I need to make it wait before spawning(painting) the next monster.
Firstly, you need to realize that creating an object and drawing a picture on the screen are two entirely different things.
Secondly, you don't want to sleep the whole thread. That would make your application hang (and so the user could do absolutely nothing) until the next unit spawned, at which point it would promptly hang again.
You want to use a timer.
<blockquote>
<p>I’m making a tower defence game and I need to make it wait before spawning(painting) the next monster.</p>
</blockquote>
<p>Firstly, you need to realize that creating an object and drawing a picture on the screen are two entirely different things.</p>
<p>Secondly, you don’t want to sleep the whole thread. That would make your application hang (and so the user could do absolutely nothing) until the next unit spawned, at which point it would promptly hang again.</p>
<p>You want to use a timer.</p>
2009-11-18T21:08:18-08:00
0
true
4
1475901
8
65302
2009-11-18T21:08:18-08:00
46968
bq. This is something that really bugs me. Very popular things, whether good or not, always seem to attract a large amount of negative people.
For anything you can possibly think up, most people will dislike it.
The difference between popular and not-popular things is that the people who dislike them generally don't know and don't care about the stuff that isn't popular.
<blockquote>
<p>This is something that really bugs me. Very popular things, whether good or not, always seem to attract a large amount of negative people.</p>
</blockquote>
<p>For anything you can possibly think up, most people will dislike it.</p>
<p>The difference between popular and not-popular things is that the people who dislike them generally don’t know and don’t care about the stuff that isn’t popular.</p>
2009-11-18T21:01:57-08:00
0
true
9
1475891
16
65373
2009-11-18T21:01:57-08:00
46968
If you're going to play Dragon Age (and I do recommend it if you're into tactical combat and/or role-playing games), get it on PC. You'll thank me once you start playing user-created campaigns (for free) instead of the stuff that gets ported to console (that you have to pay for).
<p>If you’re going to play Dragon Age (and I do recommend it if you’re into tactical combat and/or role-playing games), get it on PC. You’ll thank me once you start playing user-created campaigns (for free) instead of the stuff that gets ported to console (that you have to pay for).</p>
2009-11-17T22:28:42-08:00
0
true
3
1473269
5
65212
2009-11-17T22:29:15-08:00
46968
Is "Scene 1" actually a frame label of the part of your game past your preloader?
<p>Is “Scene 1” actually a frame label of the part of your game past your preloader?</p>
2009-11-17T22:24:58-08:00
0
true
4
1473264
12
65208
2009-11-17T22:24:58-08:00
46968
bq. How do I add a Thread.sleep() function to the JFrame’s
public void paint(Graphics g) area?
The question is, why would you want to?
<blockquote>
<p>How do I add a Thread.sleep() function to the JFrame’s<br />
public void paint(Graphics g) area?</p>
</blockquote>
<p>The question is, why would you want to?</p>
2009-11-17T22:22:54-08:00
0
true
4
1473262
4
65302
2009-11-17T22:22:54-08:00
46968
You need to set up the statistics on the server before they can be submitted.
Check the documentation: http://www.kongregate.com/pages/statistics-api
<p>You need to set up the statistics on the server before they can be submitted.</p>
<p>Check the documentation: <a href="http://www.kongregate.com/pages/statistics-api">http://www.kongregate.com/pages/statistics-api</a></p>
2009-11-15T10:34:52-08:00
0
true
4
1464132
2
64954
2009-11-15T10:34:52-08:00
46968
bq. Now explain how that is a strawman.
A "straw man" argument is where you set up (and then argue against) an irrelevant or weak version of the argument presented instead of challenging the actual argument.
One person setting up a straw man for other people to knock down is still a strawman argument.
bq. Guns give everyone the OPPORTUNITY to be equal in terms of self-defense.
By "equalizer", you mean "whoever has the advantage of surprise wins", right? Making them much more useful for attack than for defense.
<blockquote>
<p>Now explain how that is a strawman.</p>
</blockquote>
<p>A “straw man” argument is where you set up (and then argue against) an irrelevant or weak version of the argument presented instead of challenging the actual argument.</p>
<p>One person setting up a straw man for other people to knock down is still a strawman argument.</p>
<blockquote>
<p>Guns give everyone the <span class="caps">OPPORTUNITY</span> to be equal in terms of self-defense.</p>
</blockquote>
<p>By “equalizer”, you mean “whoever has the advantage of surprise wins”, right? Making them much more useful for attack than for defense.</p>
2009-11-15T10:28:23-08:00
0
true
9
1464103
284
24763
2009-11-15T10:28:23-08:00
46968
bq. You attempted to discredit the argument that the disabled can’t as easily defend themselves with a melee weapon as a gun by implying all attacks are from behind.
I suggested that the disabled can't easily defend themselves from a hit with a gun because a hitman would attack from behind.
If it's not a hit, then having a gun is liable to get them shot when otherwise they would have just been robbed.
<blockquote>
<p>You attempted to discredit the argument that the disabled can’t as easily defend themselves with a melee weapon as a gun by implying all attacks are from behind.</p>
</blockquote>
<p>I suggested that the disabled can’t easily defend themselves from a hit with a gun because a hitman would attack from behind.</p>
<p>If it’s not a hit, then having a gun is liable to get them shot when otherwise they would have just been robbed.</p>
2009-11-15T00:25:36-08:00
0
true
9
1462845
254
24763
2009-11-15T00:25:36-08:00
46968
bq. Proof that every single attack is from behind.
Irrelevant.
We're talking about a malicious assailant trying to kill someone. Bringing up implausible situations (such as said assailant attacking from the front when the defender has a gun drawn) and claiming they are relevant is what is ridiculous.
bq. I have no idea why this one topic seems to suffer the most from it, but it’s really terrible.
I suspect that it's because there are a lot of people on both sides with strong beliefs on the issue, who don't really understand _why_ they believe that way.
<blockquote>
<p>Proof that every single attack is from behind.</p>
</blockquote>
<p>Irrelevant.</p>
<p>We’re talking about a malicious assailant trying to kill someone. Bringing up implausible situations (such as said assailant attacking from the front when the defender has a gun drawn) and claiming they are relevant is what is ridiculous.</p>
<blockquote>
<p>I have no idea why this one topic seems to suffer the most from it, but it’s really terrible.</p>
</blockquote>
<p>I suspect that it’s because there are a lot of people on both sides with strong beliefs on the issue, who don’t really understand <em>why</em> they believe that way.</p>
2009-11-15T00:18:27-08:00
0
true
9
1462834
252
24763
2009-11-15T00:20:22-08:00
46968