Programming 2d games in c

I would start with learn a little object oriented architecture - this is a key to your ultimate success. Then learn how to design the model - the entities in the game characters and etc in code and the view - the 2D representation of them, and how to connect the two data and command binding.

The code project has a lot of good articles for beginners. I would take a look at SDL. Net it's a pretty good games library for. NET well a binding to a good library for the pedants ;. It has a lot of resources on its pages right from beginner stuff to more advanced things like isometric engines etc. It doesn't seem to have been very active for a while however what is there already is more than enough for even complex 2D games. Stack Overflow for Teams — Collaborate and share knowledge with a private group.

Create a free Team What is Teams? Collectives on Stack Overflow. Learn more. Asked 11 years, 10 months ago. Active 11 years, 6 months ago. Viewed 34k times.

Improve this question. Bloodyaugust Bloodyaugust 2, 8 8 gold badges 29 29 silver badges 46 46 bronze badges. As I stated in my question, Google is fine, but I would like to know which tutorials are the best.

There are thousands of these tutorials, and I am new to programming, so I would prefer to utilize the experience this site contains. And clarifying the kind of answer I am looking for is far from demanding. Those questions would be asked, so why not just answer them now?

I fully agree with bloodyaugust, I see no problem with asking this here, especially because it then becomes a Google-able page which has a voted overview of the best articles. In XNA its actually quite easy to to 2D stuff, they have a few built in classes that will help and then there are quite a few projects out there that build on XNA to give an even more comprehensive range of 2D classes.

Add a comment. Like Like. Will keep that in mind and explain it as you did whenever the series reach that point. Thank you very much. I am new to c, mostly did programming in java. So please explain what you meant here by multiple draw function?

In other languages like Java you could build it with classes, where each StateManager instance would have an Init method you would use it like this: StateManager. But dont worry, this wont last, we will probably mimmic the class behaivour in next chapters with structs and function pointers. Thanks for the tutorial. I am start to writing the 2.

You are commenting using your WordPress. You are commenting using your Google account. You are commenting using your Twitter account. You are commenting using your Facebook account.

Notify me of new comments via email. Notify me of new posts via email. Skip to content. Index: Part 1: the state manager Part 2: the graphic initialization Part 3: the engine entity The core of any game is the engine, game engines are the most important piece, the foundation or everything to be built on.

The state manager Games are divided in states or scenes, just like applications are divided in screens. So our statemanager systems looks like this now: statemanager.

It pushes the state2, does the same than the first push. Calls update, state1 has no update method, nothing happens. At the game start, the snake is two segments long with a head and a tail. Both can point in 4 directions. For north the head is index 3, the tail is 7, for the east head is 4, the tail is 8, for the south head is 5 and the tail is 9, and for the west, the head is 6 and tail is While the snake is two segments long the head and tail are always degrees apart, but after the snake grows they can be 90 or degrees.

The game starts with the head facing north at location and the tail facing south at , roughly central. At a slight cost of some 1, bytes of storage, we can gain a discernible speed improvement in the game by holding the snake's locations in the snake[] ring buffer mentioned above. A ring buffer is a block of memory used for storing a queue that is a fixed size and must be big enough to hold all data. In this case, it's just for the snake. The data is pushed on the front of the queue and taken off the back.

If the front of the queue hits the end of the block, then it wraps around. So long as the block is big enough, the front of the queue will never catch up with the back.

Every location of the snake i. This gives speed benefits because no matter how long the snake gets, only the head, tail and the first segment after the head if it exists need to be changed as it moves. Storing it backwards is also beneficial because when the snake gets food, the snake will grow when it's next moved. This is done by moving the head one location in the ring buffer and changing the old head location to become a segment.

The snake is made up of a head, 0-n segments , and then a tail. When the snake eats food, the atefood variable is set to 1 and checked in the function DoSnakeMove. We use two index variables, headindex and tailindex to point to the head and tail locations in the ring buffer. These start at 1 headindex and 0. So location 1 in the ring buffer holds the location of the snake on the board. Location 0 holds the tail location. When the snake moves one location forward, both the tailindex and headindex are incremented by one, wrapping round to 0 when they reach So now the location that was the head is where the tail is.