Jump to content

  • Log In with Google      Sign In   
  • Create Account


Member Since 20 May 2012
Offline Last Active Yesterday, 10:00 AM

Topics I've Started

2D Mobile Game Like Crash Banticoot

30 May 2014 - 01:28 PM

It has been 2 weeks since I have started developing a 2d platform game for android with game maker. (I'm doing the programming,sound and my friend the art).


I really really loved the crash banticoot games for their gameplay and sense of humor.


So the game's gameplay is almost identical to crash banticoot games (expect this time it's 2D).

This core gameplay elements will be:


Player Movement


- Jump (there wont be double jump, at least on the first levels - first release)

- Attack (should he spin like Crash? I want to avoid making the game too much of a copycat. Any suggestions will be very welcomed!) 

- Duck (when the player ducks he wont be able to move)


Most Enemies will get killed


- When the player jumps above them

- When the player attacks them


The player will collect some kind of fruit (maybe yellow grapefruit).

100 fruits == 1 life




 - Fruit,Life Boxes

 - Bomb Boxes (touch them and get killed)

 - 1 Time Touch Bomb Boxes (allow you to touch them only once before they explode)


The first "difference" in this game in comparisson to crash games.

Power Ups inside levels that will make you : 

 - Run faster

 - Jump Higher

 - Improved Attack



I'm thinking abot making 7 levels and 1 boss fight at first release.


I would like you to give me some suggestions about what gameplay improvements can be made in order to create a more fun game that will also distinguish itself from the crash banticoot games.



This is how the main character looks. 2nhkia8.png



Thanks in advance!!!

AD Revenue in Google Play

28 May 2014 - 12:55 PM

Straight to the point... :P


How much is the average AD Revenue for a game with 1 million downloads in google play? 


Thanks in advance. :)

C++ Primer - CodeBlocks

14 February 2014 - 02:43 AM

I was just going to finish the first chapter of C++ Primer(nothing difficult :P ). When I came across


#include <iostream>
#include "Sales_item.h"
int main()
  Sales_item book;
  // read ISBN, number of copies sold, and sales price
  std::cin >> book;
  // write ISBN, number of copies sold, total revenue, and average price
  std::cout << book << std::endl;
  return 0;

I went to the site the book suggested. Downloaded the MS Visual Studio 2012 files. Then I tried to link the libraries to my project in CodeBlocks and my compiler did not recognise the library "Sales_item.h". Could you help me solve this problem?

From C to ?

12 February 2014 - 02:27 AM

So I want to move on from C to an object oriented language. (C++, C# or Java)


My C knowlege is not that advanced.

But I have learned all the basics of the language. (pointer,arrays, structures, input output files, dynamic memory)


I don't plan to move on Java because I am going to learn it along with my university class next year.


This leaves me with C++ and C#. I think it's best for me to move on to C++. But there's a big fuss on learning C++  the C way. And because I know C I don't want to start using C in C++. This is something I want to avoid.


So I want a book that doesn't learn you to program the C way in C++. I don't care if it's an super introductory book I don't mind. I just want the book to explain well the object oriented concepts and the best way to program in C++.




Thanks smile.png



Find Min with Recursion

30 January 2014 - 09:41 AM

So I am trying to create an algorithm in C that finds the Min number of an array A[n] using recursion.
What the algorithm does is split the array to  2 equal subsections until the subsections become with only one position left. Until n = 1 so min = A[0]. Then it goes back and the subsectopms start comparing each other.

This is where I have gotten so far.

#include <stdio.h>
#define N 10

int min_num(double T[],int n);

int main()
	double T[]={4,5,10,5,7,3,6,2,8,9};
	double min;
	min = min_num(T,N);

	printf("min = %g\n",min);
	return 0;

int min_num(double T[],int n)

	double min; // the min number
	if (n == 1)
		min = T[0];

		int k;
		k = n/2;
		double SubsectionA_T[k];
		double SubsectionB_T[n-k];

		int i;
		double x,y;
		for (i=0;i<k;i++)
			SubsectionA_T[i] = T[i];
		for (i=k; i<N; i++)
			SubsectionB_T[i] = T[i];

		x = min_num(SubsectionA_T, k);
		y = min_num(SubsectionB_T, n-k);
		min = x;
		if (x > y)
			min = y;
	return min;