Jump to content

  • Log In with Google      Sign In   
  • Create Account


KhanA exercises


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
2 replies to this topic

#1 hit   Members   -  Reputation: 113

Like
0Likes
Like

Posted 19 December 2012 - 02:29 AM

is the completion of all khan exercises ( http://i46.tinypic.com/2cp5lqr.jpg ) a good enough indicator that
i know linear algebra, triginometry, geometry, etc enough for 3d game programming?
do the exercises not cover what is done in the videos?

im planning on reading (Mathematics for 3D Game Programming and Computer Graphics)
and or (3D Math Primer for Graphics and Game Development) both around 500 pages afterwords.

also reading a discrete mathematics book around 900 pages

khan exercises + 3d books + discrete math, for game programming = a good plan ?

Edited by hit, 19 December 2012 - 02:32 AM.


Sponsor:

#2 Bacterius   Crossbones+   -  Reputation: 8530

Like
0Likes
Like

Posted 19 December 2012 - 03:02 AM

Well, I don't know, try to write a game and see what happens I guess. This question can't really be answered by anything other than "it depends". Besides, there's a world of difference between theory and application (it's important to know the theory, but you'll still be doing a lot of reading while trying to solve an actual, real problem you're having, believe me).

Put differently, knowledge without action is futile, so I'd say try and put the ideas you discovered in your books into application every 100 pages or so (not a full game, even just a prototype which implements some algorithm you learned about, that kind of stuff) but that's just my two bytes.

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

 

- Pessimal Algorithms and Simplexity Analysis


#3 Steve_Segreto   Crossbones+   -  Reputation: 1512

Like
0Likes
Like

Posted 19 December 2012 - 11:44 AM

What are Khan exercises? Is it like yoga for the mind ;)




Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS