Skip to main content

html5 games and native games

html5




which framework and why?
=====================================================================
http://www.createjs.com/#!/EaselJS

if  you are a html5 developer and looking for a fast and reliable library for you html5 projects(games+banners) then

easeljs be your first choice i am working from last two years with this great library and create almost five games running smoothly 60 framerate on both browser and tablets even i gained a stable framerate of 60fps on ipad2 and ipad retina display .

what should i follow while creating a html5 games with easeljs
===================================================

always use global declaration for reuse variables
1)
 http://www.typescriptlang.org/ 

javascript  classes :)


2)
http://wipetouch.codeplex.com/

all swipe of touch events you need for a complex game


3)
http://www.greensock.com/

a amazing tween library by greenshock

4)
http://indiegamr.com/easeljs-pixel-perfect-collision-detection-for-bitmaps-with-alpha-threshold/

a collision detection class between bitmap and animated sprites

5)box2d no need to explain a physics library for your gaming projects




the next in my book is

http://www.pixijs.com/

 a superfast 2d html5 gaming engine which provide webGL for web and ios



but when you are looking for more stable games mainly for ios and android then you need

switch to native or flash


starling is a flash as3 library for android or ios games

starling is a really fast  more fast then any webgl html5 library


http://gamua.com/starling/


nape is a open source physics library fully supported by starling



http://napephys.com/


using nape+starling for a physics game


when working with flash i found similar native api for ios and android game development

such as

http://gamua.com/sparrow/

a native development small library for ios games  when provide all you need for a fast and cool game


http://www.cocos2d-iphone.org/

best open source for ios native development now cocos2d3 have built in physics support yeah chipmunk is added to this cool engine.


sprite kit 

Sprite Kit provides a graphics rendering and animation infrastructure that you can use to animate arbitrary textured images, or sprites.

one of the coolest and easiest framework

provide all you need to create a game.






Comments

Popular posts from this blog

Creating a word Scramble game where you can drag and drop the word and create a complete word. (drag and drop word Scramble game).

Creating a word game using  phaser game engine which is a javascript based gaming engine  where u can drag and drop world like Word Scramble Game and complete a given word. your index.html file look like below < html > < head > < script src = "src/phaser.min.js" ></ script > < script src = "src/wordGame.js" ></ script > < script src = "src/main.js" ></ script > </ head > < body > </ body > </ html > 1.    <script src="src/phaser.min.js"></script> required to run the  phaser game engine. 2. rest of the two files deals with game logics      <script src="src/wordGame.js"></script>       <script src="src/main.js"></script> you can download whole project from https://github.com/manishchauhan/wordgame/tree/master just copy and paste the project in your local server and run ...

starting with three.js and react with a very simple example

 1. three.js is undoubtedly the best library to create interactive content for the web in 3d. link https://threejs.org/ a working sample of three with react can be found below https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js why choose threejs 1. lightweight  2.fast 3.big community  https://discourse.threejs.org/ 4. even you can use unity or unreal to publish html5 content but i don't think that would be acceptable in many cases. 5. open-source project. i created a running sample with React  https://stackblitz.com/edit/react-7n5qf9?file=src%2FApp.js

A simple binary search tree with generic approach tree can store any type of data. (DFS and BFS)

 1. a binary search tree in c++ using a generic approach with both BFS and DFS approach    working tree    https://www.onlinegdb.com/edit/HkuQLdA-w code=> some properties of binary search tree-> 1. binary search tree is not always a balanced tree.  2. Inorder, traversing gives you sorted data.  3.  best is o(log n) and worst is O(n).  4. left node data is always less than root data and right node data always be greater than root data.  5. red-black tree STL map is a balanced binary search tree. *******************************************************************************/ #include <stdio.h> #include<iostream> #include<queue> using namespace std; template < typename T > class Node {   //can store any type of data private:   //genric data or store any type of data   T data;   //reference of left pointer   Node *left = nullptr;   //reference of right pointer   Node *rig...