Java-Gaming.org    
Featured games (79)
games approved by the League of Dukes
Games in Showcase (477)
Games in Android Showcase (108)
games submitted by our members
Games in WIP (536)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
 
   Home   Help   Search   Login   Register   
  Show Posts
Pages: [1] 2 3 ... 18
1  Discussions / General Discussions / Re: Netbeans + Gradle = Im annoyed. on: 2014-07-28 02:00:49
You can just use different project group for every project which is composed from many smaller projects - in this way everything is much cleaner. Smiley

Still annoying.
Because when you change project group, you cant access other projects code.
2  Discussions / General Discussions / Re: Netbeans + Gradle = Im annoyed. on: 2014-07-27 07:05:30
What do you exspect when you have two projects with the same name?
Load your multi-project projects into seperate project groups, maybe?

They arent two projects with the same name.
They are two different projects.If they have subProjects,they should be at least connected in the graph in a correct form.

And yes, i did use project groups. its still annoying because normally i check the code of the other project to compare.


Its annoying.
They should at least make it like this :

-Project A
--->Core
--->Desktop


-Project B
--->Core
--->Desktop

But instead, we have this :

-Project A
-Project B
-Core
-Core
-Desktop
-Desktop


Do you think theres no problem with this whatsoever?
3  Discussions / General Discussions / Netbeans + Gradle = Im annoyed. on: 2014-07-26 21:58:54
I have 2 cores.
Which one is from which project?
And which desktop is from which project?

Is there anyway to rename that?
*Tried to rename it and it failed*

4  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-29 19:02:56
@Kevin
Indeed, I've already conceded that there are simpler ways. None of my postings are must do's, and while some things may seem a bit contrived, I can only say that usually happens when introducing a new concept to someone. Ever read some of the examples given for design patterns?

I don't disagree with showing the horizons and all that. My only point is that in this case, simpler is definitely better. If somebody who had never programmed before asked you about design patterns, would you get into specifics or would you tell them to try some basic Hello World tutorials first? In this case, a balloon is Hello World.

Im not doing by myself. I will have people helping me with those other issues.
Smiley
5  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-29 18:05:55
What you mean with this :
"...I would highly recommend using a delta wing configuration or a glider setup. A blimp is pretty much a giant sail in the sky from the winds perspective and most PC grade engines..."

-

Well im just analyzing all possibilities and checking how i can do it , what is possible, what i can do, what i cant do, what is impossible, etc.. so i can draw a line between where i can go and where i cant go.
6  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-28 20:24:27
3 KM Altitude wont be enough for what i want.




Plus, the state where i live is ~~760m above the sea level.

Add more 3 km = 3.760 meters.

What kind of view can i get from that i wonder...
7  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-28 20:12:06
I want java no matter what.
Unless its impossible to do it with java, then i will do it something else.

I checked my Country Website and it seems i need to contact this Gov dep :
http://www.decea.gov.br/

I will have to give them a good explanation and a good overview of the project.

I also need to have a notion of what its like 3 KM above the ground, and what is like 2 KM etc...

Awesome how i studied geography for so long and dont have that notion.. i mean, i know the atmosphere is divided and bla bla bla, but for a real life project.. that knowledge aint enough


CodeHead, awesome post. My most problem now is this :

A) Danger and Law/Rights
B) How to Fly that high and Retrieve
C) What Air Equip to use ? Blimp or another air vehicle?
D) Ideas for research like.. what will i do up there? Take photos, check for gases? Is it possible with arduino?
E) Cost


..
Then the rest is just effort!
Im sure i will have my teachers into it.Its really exciting!


8  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-28 19:56:51
I was thinking in adding some gas sensors into it just for tests purposes..
9  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-28 19:26:40
Thanks so much for the replies.

Just to be clear : I want to use Java. Period.Its a matter of principle.Maybe immature principle but i want to.

Also, i will have my dad as help, he have a degree in engineering ( i didnt talk to him about this idea yet).Also, i guess i could ask my college teachers for help, one of them , im 100% sure will be preety interested in the results.

Obviously i wont do it alone haha.

So, using a cable or rope is totally insane right? Weight of the rope.. i didnt think of that Sad  

Plus, im more worried about the baloon going out of control and crashing into someone than if it will work or not.
How can i make it preety secure? I mean... The place where my dad works its a preety wide area ( city ) , plus theres a lot of vegetation near there which i could launch.Then again, i cant control the winds in the atmosphere and command the winds to not push it into the city...

--
Now,
A Zepellin...
Thats a good idea.
I dont think it would be that expensive.How controllable would it be?

Im also thinking in those planes controlled by RF.. i could, idk just put it below the plane and use the arduino while its flying...



What kind of zepellin would i need?


---
"Warning - while you were typing a new reply has been posted. You may wish to review your post."
CodeHead, i will check it out, although, going outer space is not my idea right now , but its a great help to see how they did.
10  Discussions / General Discussions / Re: I want to see Above the Sky With Java + Arduino. on: 2014-06-28 07:18:07
Ok this was preety stupid thought of mine, 5 KM of Rope would be freaking expensive, wtf  was i thinking?

Or am i wrong?
How much would it cost anyway ?

I saw 500m of Some weak rope for 80 dollars.


So maybe i have to put the baloon in somewhere wide and just wait the baloon to come down? That seems preety WEIRD.
11  Discussions / General Discussions / I want to see Above the Sky With Java + Arduino. on: 2014-06-28 07:10:09
I dont care if its impossible.I want to do it.

I saw an image like this in my Brasilian Website news :

I wanted to get an image/Video Stream like that


Or if im being too ambitious, maybe this :



So i started researching but my knowledge on engineering is poor.

I dont even know where to start.

I guess for communication i would need some kind of internet ? RF signal maybe? Arduino and java can do that.
I would also need a receiver.

Also, i would need a baloon ?
 Im unsure if its allowed to throw baloons like thatin the air without asking permission,then again is there any cable that i could attach into it to pull it back? I dont know because the winds up there are preety strong, plus how much cable i would need? like 3 KM of cables?
Ok so if i go with that, i would need a gas baloon that cant put stuff on fire. So helium?

Im also worried, what if the baloon escapes and falls... Could it hurt someone? I know the chances are small but it could happen. Couldnt it?

I Just found that:
http://www.telegraph.co.uk/news/newstopics/howaboutthat/5005022/Teens-capture-images-of-space-with-56-camera-and-balloon.html

Thats extreme. Would be fun to do it but i just want to check the sky with my arduino .

Also, theres the problem of magnetism? I mean.. will stratosphere mess up the signals?

Ok So to sum up my worries :

a) How Far should i go in Height to have a good view?
b) Should i use some kind of rope?
c) If the baloon escapes from the Rope or if i dont use the rope, could it hurt someone?
d) Is there any law that forbids me to make those tests? i could idk, put a sensor to check for certain gases quantity ( that would be cool )
e) In case i use a "rope" i will have to check if it can take the strenght of the winds...
f) What kind of shield could i use in my arduino?


So i just want to put something up there. What will it do, if its just photos or sensors, its not decided, but i want to do it Smiley

What you guys think of it?


PS : Replies like :
YOU CANT DO IT, GO BACK TO RPG-MAKER will be ignored and will be considered stupid.
Since someone said that to me when i started in this forum and my game is 85% finished with libgdx.

Opinions and suggestions and criticals are welcome..
Im trying to check if its possible or not.







12  Game Development / Artificial Intelligence / Re: How to implement N-Opt in Genetic Algorithm To Solve the Travelesman Problem? on: 2014-06-22 21:32:54
It works fine without 2-opt method.

Now im trying to implement 2-opt into the mutate() method...
13  Game Development / Artificial Intelligence / Re: How to implement N-Opt in Genetic Algorithm To Solve the Travelesman Problem? on: 2014-06-22 20:10:24
Ok, i made a small example class...
Not working, having NPE issues..
Can anyone help me?

1  
2  
3  
4  
5  
6  
7  
8  
9  
10  
11  
12  
13  
14  
15  
16  
17  
18  
19  
20  
21  
22  
23  
24  
25  
26  
27  
28  
29  
30  
31  
32  
33  
34  
35  
36  
37  
38  
39  
40  
41  
42  
43  
44  
45  
46  
47  
48  
49  
50  
51  
52  
53  
54  
55  
56  
57  
58  
59  
60  
61  
62  
63  
64  
65  
66  
67  
68  
69  
70  
71  
72  
73  
74  
75  
76  
77  
78  
79  
80  
81  
82  
83  
84  
85  
86  
87  
88  
89  
90  
91  
92  
93  
94  
95  
96  
97  
98  
99  
100  
101  
102  
103  
104  
105  
106  
107  
108  
109  
110  
111  
112  
113  
114  
115  
116  
117  
118  
119  
120  
121  
122  
123  
124  
125  
126  
127  
128  
129  
130  
131  
132  
133  
134  
135  
136  
137  
138  
139  
140  
package br.Lopes.Logic;

/**
 *
 * @author Andre Lopes
 */

public class Logic {

    private Waypoint waypoints[];

    public static void main(String args[]) {
        Logic logic = new Logic();
        logic.optimizeRoute(logic.waypoints);

    }

    public Logic() {
        waypoints = new Waypoint[4];

        //Add A--> C and C-->D and D--> B
       waypoints[0] = new Waypoint(0, 0, "A"); //Left Bottom
       waypoints[1] = new Waypoint(5, 5, "C"); // Right Top
       waypoints[2] = new Waypoint(0, 5, "B"); //Left Top
       waypoints[3] = new Waypoint(5, 0, "D"); //Right Bottom

    }

    public Waypoint[] optSwap(Waypoint waypoints[], int i, int k) {

        Waypoint auxWaypoints[] = new Waypoint[waypoints.length];

        for (int index = 0; index < i - 1; index++) {
            System.out.println("Step 1 : Index :" + index);
            auxWaypoints[index] = waypoints[index];
        }
        System.out.println("Step 1 : ");
        //printVector(auxWaypoints);

        int reverse = k;
        for (int index = i; index < k; index++) {
            auxWaypoints[index] = waypoints[reverse];
            reverse--;
        }
        System.out.println("Step 2 : ");
        printVector(auxWaypoints);

        for (int index = k + 1; index < waypoints.length; index++) {
            auxWaypoints[index] = waypoints[index];
        }
        System.out.println("Step 3 : ");
        printVector(auxWaypoints);

        return auxWaypoints;

    }

//     2optSwap(route, i, k) {
//       1. take route[0] to route[i-1] and add them in order to new_route
//       2. take route[i] to route[k] and add them in reverse order to new_route
//       3. take route[k+1] to end and add them in order to new_route
//       return new_route;
//   }
//    
//      example route: A ==> B ==> C ==> D ==> E ==> F ==> G ==> H ==> A
//   example i = 4, example k = 7
//   new_route:
//       1. (A ==> B ==> C)
//       2. A ==> B ==> C ==> (G ==> F ==> E ==> D)
//       3. A ==> B ==> C ==> G ==> F ==> E ==> D (==> H ==> A)
//    
//          repeat until no improvement is made {
//       start_again:
//       best_distance = calculateTotalDistance(existing_route)
//       for (i = 0; i < number of nodes eligible to be swapped - 1; i++) {
//           for (k = i + 1; k < number of nodes eligible to be swapped; k++) {
//               new_route = 2optSwap(existing_route, i, k)
//               new_distance = calculateTotalDistance(new_route)
//               if (new_distance < best_distance) {
//                   existing_route = new_route
//                   goto start_again
//               }
//           }
//       }
//   }
   public void optimizeRoute(Waypoint waypoints[]) {
        int numberOfRowsToBeSwapped = waypoints.length;
        int numberOfColumnsToBeSwapped = waypoints.length;

        double bestDistance = calculateTotalDistance(waypoints);

        //Aux Variables
       Waypoint[] new_route;
        double new_distance;
        for (int i = 0; i < numberOfRowsToBeSwapped - 1; i++) {
            for (int k = i + 1; k < numberOfColumnsToBeSwapped; k++) {
                System.out.println("OptSwap : (i;k)" + i + ";" + k);
                new_route = optSwap(waypoints, i, k);
                System.out.println("New Route Calculated!");
                new_distance = calculateTotalDistance(new_route);

                if (new_distance < bestDistance) {
                    this.waypoints = new_route;
                    System.out.println("New Route Set!");
                }
            }
        }
    }

    public double calculateTotalDistance(Waypoint waypoints[]) {
        double distance = 0;
        for (int i = 0; i < waypoints.length; i++) {
            Waypoint auxpoint = waypoints[i];
            double dx = 0, dy = 0;
            if (i > 0) {
                dx = waypoints[i - 1].getX() - auxpoint.getX();
                dy = waypoints[i - 1].getY() - auxpoint.getY();
            }

            System.out.println("Name : " + auxpoint.getName());
            distance += Math.sqrt(dx * dx + dy * dy);
        }

        System.out.println("Calculated Distance :" + distance);
        return distance;

    }

    private void printVector(Waypoint waypointsAux[]) {
        for (int index = 0; index < waypointsAux.length; index++) {
            Waypoint auxpoint = waypointsAux[index];
            if (auxpoint == null) {
                System.out.println("WayPoint[" + index + "] = NULL!");
                break;
            }
            System.out.println("\nWayPoint");
            System.out.println("Name : " + auxpoint.getName());
            System.out.println("X;Y :" + auxpoint.getX() + ";" + auxpoint.getY());
        }
    }
}

14  Game Development / Artificial Intelligence / Re: How to implement N-Opt in Genetic Algorithm To Solve the Travelesman Problem? on: 2014-06-21 20:22:25
Guys, i got this Now.
But im confused with this part:

1  
2  
3  
4  
5  
6  
  2optSwap(route, i, k) {
       1. take route[0] to route[i-1] and add them in order to new_route
       2. take route[i] to route[k] and add them in reverse order to new_route
       3. take route[k+1] to end and add them in order to new_route
       return new_route;
   }



1.
2.
3.

What exactly should we do?Huh

1  
2  
3  
4  
5  
6  
7  
8  
9  
10  
11  
12  
13  
14  
15  
16  
17  
18  
19  
20  
21  
22  
23  
24  
25  
26  
27  
28  
29  
30  
31  
32  
33  
34  
35  
36  
37  
38  
39  
40  
41  
42  
43  
44  
45  
46  
47  
48  
49  
50  
51  
52  
53  
54  
55  
56  
57  
58  
59  
60  
61  
62  
63  
64  
65  
66  
67  
68  
69  
70  
71  
72  
73  
74  
75  
76  
77  
78  
79  
80  
81  
82  
83  
84  
85  
86  
87  
88  
89  
90  
91  
92  
93  
94  
95  
96  
97  
98  
99  
100  
101  
102  
103  
104  
105  
106  
107  
108  
109  
110  
111  
112  
113  
114  
115  
116  
117  
118  
119  
120  
121  
122  
123  
124  
125  
126  
127  
128  
129  
130  
131  
132  
133  
134  
135  
136  
137  
138  
139  
140  
141  
142  
143  
144  
145  
146  
147  
148  
149  
150  
151  
152  
153  
154  
155  
156  
157  
158  
159  
160  
161  
162  
163  
164  
165  
166  
167  
168  
169  
170  
171  
172  
173  
174  
175  
176  
177  
178  
179  
180  
181  
182  
183  
184  
185  
186  
187  
188  
189  
190  
191  
192  
package net.nexusteam.tsmGaSolver.ann;

import net.JeffHeatonCode.Chromosome;
import net.JeffHeatonCode.NeuralNetworkError;

/** @author Mix Of Jeff Heaton Code with Our Team Code */
public class TSPChromosome extends Chromosome<Integer, TSPGeneticAlgorithm> {

   protected Waypoint[] path;

   public TSPChromosome(final TSPGeneticAlgorithm owner, final Waypoint path[]) {
      setGeneticAlgorithm(owner);
      this.path = path;

      final Integer genes[] = new Integer[this.path.length];
      final boolean taken[] = new boolean[path.length];

      for(int i = 0; i < genes.length; i++) {
         taken[i] = false;
      }
      for(int i = 0; i < genes.length - 1; i++) {
         int icandidate;

         do {
            icandidate = (int) (Math.random() * genes.length);
         } while(taken[icandidate]);

         genes[i] = icandidate;
         taken[icandidate] = true;
         if(i == genes.length - 2) {
            icandidate = 0;

            while(taken[icandidate]) {
               icandidate++;
            }

            genes[i + 1] = icandidate;
         }
      }
      setGenes(genes);
      calculateCost();

   }

   @Override
   public void calculateCost() throws NeuralNetworkError {
      double cost = 0.0;
      for(int i = 0; i < path.length - 1; i++) {
         final double dist = path[getGene(i)].dst(path[getGene(i + 1)]);
         cost += dist;
      }
      setCost(cost);

   }

   @Override
   public void mutate() {
      final int length = getGenes().length;
      final int iswap1 = (int) (Math.random() * length);
      final int iswap2 = (int) (Math.random() * length);
      final Integer temp = getGene(iswap1);

      setGene(iswap1, getGene(iswap2));
      setGene(iswap2, temp);
      getGeneticAlgorithm().incrementMutationCounter();

      boolean use2OptSwap = false;
      if(use2OptSwap)
      {
         setGenes(optimize(getGenes()));

      }

      // System.out.println("Mutation Calls : " + getGeneticAlgorithm().gettimesMutated());

   }

   //2Opt Methods
  private Waypoint[] optSwap(Integer genes[], int i, int k)
   {

      //Step 1

      for(int index = i; index < i - 1; i++)
      {

      }

      //Step 2

      for(int index = i; index < k; i++)
      {

      }

      //Step 3

      for(int index = k + 1; index < genes.length; i++)
      {

      }

      //2optSwap(route, i, k) {
     //     1. take route[0] to route[i-1] and add them in order to new_route
     //   2. take route[i] to route[k] and add them in reverse order to new_route
     //  3. take route[k+1] to end and add them in order to new_route
     //  return new_route;
     // }

      //

      return path;
   }

   /**
    * @param genes
    * @return
    */

   private Integer[] optimize(Integer genes[])
   {
      boolean improved = false;
      double best_distance = Double.MAX_VALUE;

      while(!improved)
      {
         calculateCost();
         best_distance = getCost();

         for(int i = 0; i < getGenes().length; i++)
         {
            for(int k = i + 1; k < getGenes().length; k++)
            {

               TSPChromosome newRoute = new TSPChromosome(this.getGeneticAlgorithm(), optSwap(genes, i, k));

               newRoute.calculateCost();

               double new_distance = newRoute.getCost();

               if(new_distance < best_distance)
               {
                  improved = true;
                  genes = newRoute.getGenes();
               }

            }
         }
      }

      return genes;

      // repeat until no improvement is made {
     //     start_again:
     //   best_distance = calculateTotalDistance(existing_route)
     // for (i = 0; i < number of nodes eligible to be swapped - 1; i++) {
     //   for (k = i + 1; k < number of nodes eligible to be swapped; k++) {
     //     new_route = 2optSwap(existing_route, i, k)
     //   new_distance = calculateTotalDistance(new_route)
     // if (new_distance < best_distance) {
     //   existing_route = new_route
     // goto start_again
     //}
     //}
     //}
     //}

      //
  }

   /** Used to compare two chromosomes. Used to sort by cost.
    *
    * @param other The other chromosome to compare.
    * @return The value 0 if the argument is a chromosome that has an equal cost to this chromosome; a value less than 0 if the
    *         argument is a chromosome with a cost greater than this chromosome; and a value greater than 0 if the argument is a
    *         chromosome what a cost less than this chromosome. */

   @Override
   public int compareTo(Chromosome<Integer, TSPGeneticAlgorithm> other) {
      if(getCost() > other.getCost()) {
         return 1;
      } else if(getCost() == other.getCost())
         return 0;
      else {
         return -1;
      }
   }

   /** @return the {@link #path} */
   public Waypoint[] getPath() {
      return path;
   }

}
15  Game Development / Artificial Intelligence / How to implement N-Opt in Genetic Algorithm To Solve the Travelesman Problem? on: 2014-06-21 01:52:14
Hi Guys,
How to implement N-Opt in Genetic Algorithm To Solve the Travelesman Problem?

Im trying to implement 2-opt in a GA algorithm, but im confused in how-to..
Should i implement it in the mutate() method or mate() method?

https://bitbucket.org/dermetfan/tsm-ga-solver/src/73f2a35bf2e036bdcca03bef4340eeb683dc620e/core/src/main/net/nexusteam/tsmGaSolver/ann/TSPGeneticAlgorithm.java?at=default

https://bitbucket.org/dermetfan/tsm-ga-solver/src/73f2a35bf2e036bdcca03bef4340eeb683dc620e/core/src/main/net/nexusteam/tsmGaSolver/ann/TSPChromosome.java?at=default


//

https://bitbucket.org/dermetfan/tsm-ga-solver/src/73f2a35bf2e036bdcca03bef4340eeb683dc620e/core/src/main/net/JeffHeatonCode/GeneticAlgorithm.java?at=default

https://bitbucket.org/dermetfan/tsm-ga-solver/src/73f2a35bf2e036bdcca03bef4340eeb683dc620e/core/src/main/net/JeffHeatonCode/Chromosome.java?at=default


I know in theory how 2-opt should WORK :

Example :
For 4 Cities A,B,C,D

A  B
C  D

A--> D -->C -->B

Their connections form  concorrent lines..
The method should be capable to Transform that into either these :

A-->B-->D-->C
or
A-->C-->D-->B

The one with less cost obviously.

Im not getting how to do it.
I know how to identify if a line intersects other by using

f(x) = mx + b
Or is there any other way i should do it?
16  Game Development / Newbie & Debugging Questions / Re: Some Questions About Libgdx App.Methods on: 2014-06-07 03:52:45
config.audioDeviceBufferCount = 1;
        config.audioDeviceBufferSize = 2;
        config.audioDeviceSimultaneousSources = 1;


Yes i have that, but what does it means?

config.audioDeviceBufferCount :audioDeviceBufferCount the audio device buffer count

the audio device buffer size in samples

the maximum number of sources that can be played simultaneously

Allows software OpenGL rendering if hardware acceleration was not available.


What all that means?
What happens if i put the max value or the lower value ?
17  Game Development / Newbie & Debugging Questions / Some Questions About Libgdx App.Methods on: 2014-06-07 03:45:33
People where can i find info about this methods :

1  
2  
3  
4  
5  
6  
LwjglApplicationConfiguration config;

     config.allowSoftwareMode = false;
        config.audioDeviceBufferCount = 1;
        config.audioDeviceBufferSize = 2;
        config.audioDeviceSimultaneousSources = 1;


what is SoftwareMode?
what is audioDevice stuff.. ?

Any help is appreciated..
       
18  Game Development / Newbie & Debugging Questions / Gradle : How to apply Source Properties? on: 2014-05-22 03:31:40
Hello Guys,
Me and a friend are using Gradle + mercurial to make a libgdx project.
And he uses eclipses and i use netbeans.
Everything was great until my netbeans started to see the main folder as a package.. And now is bugging everything.

Normally java projects have the option to change the source folder directory.
Gradle doesnt have it? At least in my netbeans properties.

I need help.
How do i change the directory of the source folder in gradle?

Im using the NB plugin of course.

Thanks in advance.
19  Game Development / Newbie & Debugging Questions / Re: How i can use AntiAliasing with LibGDX? on: 2014-05-22 03:28:46
I see.
I just actually thought openGl had some calls to make that automatically..
But yes, im using those TextureFilters. stuff Smiley
20  Game Development / Newbie & Debugging Questions / Re: How i can use AntiAliasing with LibGDX? on: 2014-05-21 22:12:21
I thought it would improve the image with those -_-_- / aliasing issues
21  Game Development / Newbie & Debugging Questions / Re: How i can use AntiAliasing with LibGDX? on: 2014-05-21 20:50:28
Alrighty!

Alrighty, so where can i get information about making a AA method? How should i work with it ?

Trollwarrior, my game is also a 2D game , im nto using box2D yet, just tiled and libgdx
22  Game Development / Newbie & Debugging Questions / Re: How i can use AntiAliasing with LibGDX? on: 2014-05-21 20:23:12
I did read, but i dont get how MultiSample is the same than Anti Aliasing?
Dont we also have that Morfologic Filter and anisotropic filter?
Which one is described in this blog? its MSAA so its the morfologic one? ( reading from AMD catalyst )


Edit : im sorry , i feel i dont have the same pace as you guys. Sorry to bother
23  Game Development / Newbie & Debugging Questions / Re: How i can use AntiAliasing with LibGDX? on: 2014-05-21 20:11:15
Have you tried googling? This is literally one of the first ones.
http://www.badlogicgames.com/wordpress/?p=2071

Yes, i read that post but i dont feel is clear enough...
I have no clue on how to enable it.
Do i just call that Gl command and enable on Gdx.Classes?
24  Game Development / Newbie & Debugging Questions / How i can use AntiAliasing with LibGDX? on: 2014-05-20 23:05:05
How i can use AntiAliasing with LibGDX?
What about Other filters? (not talking about TextureFilter.X)

25  Discussions / Miscellaneous Topics / Re: What are Anti-Virus Developers Protecting us From? on: 2014-04-17 04:01:57
I worked with IT support last years and its time for me to tell you all the truth.

The first sentence to come out of a sales mans mouth :p

Oh, Kaspersky Pure costs £34.99!

I kid lol.


Heheheh.
I dont sell kaspersky.
I HAD to sell another antivirus which was crap.

So anyway, im not a salesman and if i was ITS NOT YOUR PROBLEM.

Anything else?

I KID.
26  Discussions / General Discussions / Re: What genre/artists do you listen to while coding? on: 2014-04-15 04:41:01
Justin Bieber , Rihanna.

LOL JOKING.

Metallica, Scooter, U2, 80's,90's rock.Phil Collins, etc.
27  Discussions / Miscellaneous Topics / Re: What are Anti-Virus Developers Protecting us From? on: 2014-04-15 04:38:09
I worked with IT support last years and its time for me to tell you all the truth.

Mccafee doesnt work.PERIOD.
Norton is Meh.
Avast is meh but its free.Same for avg.If u use one of them with another anti malware, its yay.

I use kaspersky Pure 3.0.Used internet security before... Dude, its awesome.
No virus whatsoever.After i installed i ran some checks with another antiviruses to check if kaspersky was really working and it is.

Just fine.

28  Game Development / Newbie & Debugging Questions / Noob - GWT And Libgdx on: 2014-04-11 18:12:49
Well guys. Im starting to understand how to run my project in this gwt stuff...

I have 2 questions, please help me.

a) Each module/package of my code must have a gwt.xml ?

b) Do i need to insert :

1  
2  
3  
<module>
<source path=""/>
</module>


for each package-code?

What about packages inside packages?


-Please help
29  Game Development / Newbie & Debugging Questions / Re: WildCard in Class name? What!? on: 2014-03-30 22:08:33
What do you mean?
"Container"?

1  
 public abstract class Chromosome<GENE_TYPE, GA_TYPE extends GeneticAlgorithm<?>>


This Smiley

Its different than this :
ArrayList<?> ( which i understand)

The top one, i dont.
30  Game Development / Newbie & Debugging Questions / Re: WildCard in Class name? What!? on: 2014-03-30 21:32:22
It just means that the "ContainerList" can be one for any type of object (the generic type parameter), but this type must be a subtype of the class "Container".
i know what it means when its inside a object, like an array list.
But not in a class name.

..
Pages: [1] 2 3 ... 18
 

Add your game by posting it in the WIP section,
or publish it in Showcase.

The first screenshot will be displayed as a thumbnail.

CogWheelz (18 views)
2014-07-30 21:08:39

Riven (23 views)
2014-07-29 18:09:19

Riven (15 views)
2014-07-29 18:08:52

Dwinin (12 views)
2014-07-29 10:59:34

E.R. Fleming (33 views)
2014-07-29 03:07:13

E.R. Fleming (12 views)
2014-07-29 03:06:25

pw (43 views)
2014-07-24 01:59:36

Riven (43 views)
2014-07-23 21:16:32

Riven (30 views)
2014-07-23 21:07:15

Riven (31 views)
2014-07-23 20:56:16
List of Learning Resources
by SilverTiger
2014-07-31 18:29:50

List of Learning Resources
by SilverTiger
2014-07-31 18:26:06

List of Learning Resources
by SilverTiger
2014-07-31 13:54:12

HotSpot Options
by dleskov
2014-07-08 03:59:08

Java and Game Development Tutorials
by SwordsMiner
2014-06-14 00:58:24

Java and Game Development Tutorials
by SwordsMiner
2014-06-14 00:47:22

How do I start Java Game Development?
by ra4king
2014-05-17 11:13:37

HotSpot Options
by Roquen
2014-05-15 09:59:54
java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!