« first day (1014 days earlier)      last day (2400 days later) » 

12:09 AM
Grados should not be subject to import
made in USA, NAFTA
but everyone fucking ignores NAFTA :(
When goods cross borders, soldiers don't.
7 hours later…
7:39 AM
went on to see how the breakfast menu is like at the local McDonald's
I never tasted something so horrible in my entire life
at least it was cheap :(
8:21 AM
@Gajoo not sure you still need it but
actually nvm
I thought you had something less than 3.2.1
definitely a bug
1 hour later…
9:48 AM
@CodeAssassin I once asked a question regarding reverse engineering on cplusplus.com. It was closed. Silly arbitrary rules.
2 hours later…
11:55 AM
hey @William'MindWorX'Mariager
Q: What should i know to start in game development?

Tbi45I know this is asked very often here and probably my question will get closed, but i am clueless in this direction. I want to start creating my own PC games. I know C++ and a bit of C#. I created a little game in Html5 using plain javascript so i know i can do this kind of stuff. But i need so...

look, I'm not punishing them anymore :D :D :D
Haha. I was thinking about you when I saw it. :P
dunno if it's a good or bad thing
12:15 PM
It is just a thing. Good and bad are largely an optical illusion caused by where one is standing, I find.
moral illusion I'd say
you do have a point
@William'MindWorX'Mariager well, that's a thing :D
I'll do the CPP assignment for the next week, right now I found this:
Gambas is the name of an object-oriented dialect of the BASIC programming language as well as the integrated development environment that accompanies it. Designed to run on Linux and other Unix-like computer operating systems, its name is a recursive acronym for Gambas Almost Means Basic. Gambas is also the word for prawns in the Spanish language, from which the project's logos are derived. Gambas is included in a number of Linux distributions' repositories, such as Debian's, Fedora's, Mandriva Linux's and Ubuntu's. There is a Windows version of Gambas which can run under the Cygwin env...
and I really need to check it out. NOW.
also this
12:59 PM
unfortunately, it doesn't give a proper response for "what is love?" :(
really starting to hate gimp
make new image, paintbucket black, nothing
how hard can it be?!?
got it :(
1:32 PM
Morning all
Hm. Taking 500 instances of a model + transforms and baking them down into a single mesh with no transforms uses a lot more memory. About 500 times as much memory, in fact. Who would have guessed?
1:55 PM
so i think I got CocosBuilder figured out. make new project, export, put into xcode, start it, nothing. :(
2:15 PM
howdy folks
2:40 PM
figure it out yet?
._> nawp
it's hello
but with the fingers one set of keys to the right
there are a whole class of typos I make since I touch type and have a hand off sometimes
2:52 PM
like okay = plau
ij = ok
tjamls = thanks
1000 WPM
not quite that fast
I'm around 50 wpm depending on what I'm typing
That's pretty good :-) I think I was like 45 or something :P
I'm not that fast
45 is certainly decent
3:38 PM
Anyone good with Dijkstra's algo?
I think my implementation is broken :P
sure, I know its ins and outs
so in my do while... it becomes an infinite loop :(
probably because targetNode is never met.
oh no. project works in debug mode, fails in retail
:( I hate issues like this
@Almo lol you call release - retail :P
actually at Ubi we did debug, release, retail
but on the project I did, I skipped release
or maybe I didn't anyway, I hate it that it doesn't work in whatever is not debug. :)
3:45 PM
Can't believe I'm listening to he Beegees lol
(Stayin Alive)
hey they're really good songwriters
not all their stuff is good
but Main Course is mostly excellent
@JohnMcDonald I think I know what's causing the issue.
Yep. Notice how I set them to visited after each of their if's
I shouldn't have done that
 for (int i = 0; i < surroundingNodes.Length; i++)
                                        if (surroundingNodes[i].Walkable && surroundingNodes[i].Visited == false)
                                             if (surroundingNodes[i].Distance <= leastDistance)
                                                  leastDistance = surroundingNodes[i].Distance;
                                                  currentNode = surroundingNodes[i];
Meh bad formatting :(
I should actually have:
  if (surroundingNodes[i].Walkable && surroundingNodes[i].Visited == false)
                                             if (surroundingNodes[i].Distance <= leastDistance)
                                                  leastDistance = surroundingNodes[i].Distance;
                                                  currentNode = surroundingNodes[i];

Well... surroundingNodes should really be part of the node, not the solver. You only have 8 surroundingNodes ever
3:54 PM
How many surround nodes should I have?
so, iirc, you should start at the start node, calculate the distance from the start node to its neighbours, then sort the list of known but unvisited nodes by distance from start, pick a node with this shortest distance from the start, and do it all over again
See how it spreads radially? The red solid dots are visited and have a known distance from the start. The Hollow blue circles are known about, but unvisited.
@CodeAssassin umm... in your current implementation, you'll need each node to have a surroundingNodes variable
all teh rage.
Okay - editing
You read the pseudocode on wiki?
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing as a subroutine in other graph algorithms, or in GPS Technology. For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths f...
nah I didn't read the pseudocode.. I just read the steps :/
which I did wrong ^_^b
4:07 PM
one time I actually got it to build, but it was just a straight line down.
4:21 PM
there's this magazine on the history of dolls in Romania at the moment
and each issue comes with one porcelain doll included
they make for some good decorations
the clothing is top quality too
@CodeAssassin So, is there a reason you're using Djikstra's algo instead of A*?
Or simulated annealing?
I'm guessing it's Djikstra's first, followed by A*
@ShotgunNinja I have already implemented A* and am having trouble with Dijsktra's. It's for a Science Project for skool. Measuring performance :)
@JohnMcDonald Djikstra's and A* are two different ways to resolve a path between two nodes in a connected graph.
@CodeAssassin Ah, that makes sense. Are you going to try a simulated annealing approach next?
That's another fun one, that gets better the more it's used.
4:29 PM
Lol I have no idea what that is :( I was just planning on implementing three path-finding algo's. I might look into simulated annealing ^_^b thank you for the suggestion.
I really like this about Java
public Calendar parseCalendar(String icsFilePath) throws FileNotFoundException, ParserException, IOException
mainly the throws FileNotFoundException, ParserException, IOException part
@ShotgunNinja I've always viewed A* and Djistras (if implemented for a grid with normal weights) are like the same, except A* uses an estimated distance to target to figure out which node to calculate next
Well, simulated annealing effectively takes a bunch of attempts at a problem, and refines them through multiple iterations. It's good when you have a known amount of time, and need a fairly tight approximation.
It's not exactly a true pathfinding algorithm, but it can easily be adapted to graph traversal.
Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more efficient than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution. The name and inspiration come from annealing in metallurg...
"[A*] is an extension of Edsger Dijkstra's 1959 algorithm. A* achieves better time performance by using heuristics." - wiki
Rather than doing a heuristic traversal approach, you start with one permutation of a solution (poorly found), and anneal it until the "energy level" of the solution is appropriate.
@JohnMcDonald He said he already has an A* algorithm implemented, but he needs a Djikstra's for comparative analysis.
4:35 PM
The comment was directed at you
@JohnMcDonald I already know what Djikstra's and A* are, I aced my AI course last year.
k, it's just that this comment seemed to indicate the two were drastically different algorithms:
@JohnMcDonald @ShotgunNinja don't fight over such a trivial problems :|
9 mins ago, by Shotgun Ninja
@JohnMcDonald Djikstra's and A* are two different ways to resolve a path between two nodes in a connected graph.
anyway, I'm glad we're on the same page
@JohnMcDonald That they are. They both result in a path from node A to node B.
4:38 PM
both of those algorithms are used to find minimum path, but each of those two solve their own set of problems
And they both work differently.
The externally-visible difference is in time-efficiency, memory-efficiency, and optimality of the path returned.
When used on a uniform grid, they are almost identical implementations
The internally-visible difference is in the use of a heuristic-based selection system.
just note that SA is often used when there are multiple key points that you should path through all of them, and specially when the problem space is insanely great.
So, like finding all driving routes which cover a set of key cities?
or finding the "best" route?
4:46 PM
hmm... if you set the distance to target heuristic in an A* algorithm to a constant value, it effectively converts it to a Dijkstra's radial search, no?
@JohnMcDonald yep
@CodeAssassin, since you already have your A* algorithm, you should be done already
in fact that constant value should be exactly zero or else it won't fulfill requirements of heuristic function.
20 mins ago, by Code Assassin
@ShotgunNinja I have already implemented A* and am having trouble with Dijsktra's. It's for a Science Project for skool. Measuring performance :)
Y'all's be do so far ahead of me I feel like a 30 year old elementary school dropout. xD -- Might be because I cant seem to sit down and learn one single language (Work keeps Jerking me around.... so I am sticking to C# and that is final!)
4:49 PM
@ShotgunNinja edited, just for you, :)
Master the way of the C(#) and work with other languages after that.
@JohnMcDonald He's doing comparative analysis between the two.
Yeah... and?
He needs three different algorithms. One of which he has selected is Dijkstra's, and another is A*.
He can't be done with just A*, since the point of the assignment is to see in practice how they differ, with regards to performance.
He's off trying to write Dijkstra's right now, when he has an A* algorithm that can be easily converted to a Dijkstra's
4:51 PM
The Calendar Provider is a repository for a user's calendar events. The Calendar Provider API allows you to perform query, insert, update, and delete operations on calendars, events, attendees, reminders, and so on.

The Calender Provider API can be used by applications and sync adapters.
The Calender Provider API
@JohnMcDonald I doubt the intention of the assignment is to short-circuit one implementation with another.
fecal matter Google, get it together!
see? I didn't use that word again!
Having tried that in the past (and gotten marked down for it), I'd assume the professor doesn't want that. Despite how much it violates DRY.
Coffee (Check), Computer (Check), Books (Check).... I really want to write some little app that goes to a quote of the day website, snags the quote and display's it to the user every time they boot up. xD
yeah... some teachers are annoying. I got doced marks for not commenting a variable in first year: int airplaneAltitude;
// The airplanes altitude?
anyway, he knew I knew what I was doing, but wanted to make sure I didn't get 100%
5:07 PM
how I hate the RC helicopter mission in GTA VC
the controls... they're horrid
I am also listening to Google IO 2013 right now.
5:44 PM
I once got a B+ on a paper because I had 12% too many quotes
That was the only feedback I got
That's pretty specific. :P
5:57 PM
Yeah they ran it through some software that basically googled my entire paper to try and determine how much my paper was plagiarized.... I found it absolutely obnoxious
@ToddersLegrande Extreme Lazy Grading
6:13 PM
@ToddersLegrande All our assignments are subjected to that.
I think my highschool is grading papers that way too :/
6:37 PM
@CodeMonkeyAlx I can't, this time google filtered Iranians :D
6:54 PM
the maximum difficulty in the new metro game is a $5 DLC
they can go to hell
That's really greedy of them. :P
they'll probably release their next game w/ a key customization DLC
and default A and D for strafes
and Up and Down arrows for forward/backward
now THAT would be evil
Sounds like how I usually play an FPS... why is that control scheme a problem for this game?
oh wait
up and down arrows lol
@ToddersLegrande yeah :P
have a crappy rig? buy the $10 resolution pack DLC and lower the resolution!
don't miss out on the $25 texture detail pack which unlocks "low and high" settings!
@AlexM. There's a game out there that makes fun of excessive DLC.
7:01 PM
yeah I know about it
DLC quest I think
Yeah. It's actually fairly fun.
How funny. I have an Intel P8088 cpu. :P
I wonder if I could use it for anything.
I guess it'll need some programming.
Use it to count to 10, then start wrecking an attached hard drive by sending random control messages.
That's always fun.
7:35 PM
realtime map that shows what pages are edited on wikipedia atm and by who
8:01 PM
how fast is Persian wiki expanding.
it just reached 200k pages at jul2012
and now it's already passed 300k
8:27 PM
@William'MindWorX'Mariager I figured out why the game doesn't work for me :D
@William'MindWorX'Mariager It doesn't work in Private Browsing (FireFox) or in inPrivate Browsing (Internet Explorer). I tested, and it works without Private Browsing on FireFox and IE.
wow alex
god damnit lex, stop stealing cakes
cakes don't grow on trees
:P they are lies
I feel like there is a reference in that image I'm not getting
Because I feel like it must be funnier than I found it...
8:39 PM
found it on tvtropes I think
I laugh at such stuff mostly because of the Shit Tyrone, get it together! meme
hope there's no one here to get offended
bahahah, this is the best meme in the world
right there with dolan
1 hour later…
9:55 PM
hurray, made my first character custom customization thing
took forever and is super basic
but I thoguht it would be an interesting challenge
if only I had a real model to use it on rather than a stack of cubes
also I wish I knew how Unity was able to use over 1000 textures on such a simple scene
2 hours later…
11:52 PM
@BenjaminDangerJohnson You're making a little people MMO? :O
Looking for a sub 500 dollar laptop available for order TODAY - any takers on ideas? :)
shrug, pretty much anyone makes laptops under $500 these days
Since laptops are closed systems anyway, there's nothing really wrong with Dell
It's mostly build and quality control that's the concern :)

« first day (1014 days earlier)      last day (2400 days later) »