Create Brain Overdrive Game in Android

By Sidharth Patnaik -
This is yet another game like the 123Game. This game generates a single character which may be a Vowel, a Consonant, an Odd Number or may be an Even Number. The theme is you will get 3 seconds for each questions, you have to select the right option for it. If selected the right one then you will get 3 marks and the game gets over if u opt a wrong one !

Screenshots[Demo]

The Code:
For Generating Characters:
void calc()
 {
  es="02468";os="13579";vs="AEIOU";ks="BCDFGHJKLMNPQRSTVWXYZ";k="";
  Random rand=new Random();
  k=k+es.charAt(rand.nextInt((4 - 0) + 1));
  k=k+os.charAt(rand.nextInt((4 - 0) + 1));
  k=k+vs.charAt(rand.nextInt((4 - 0) + 1));
  k=k+ks.charAt(rand.nextInt((20 - 0) + 1));
  String input=k;
  List<Character> characters = new ArrayList<Character>();
        for(char c:input.toCharArray()){
            characters.add(c);
        }
        StringBuilder output = new StringBuilder(input.length());
        while(characters.size()!=0){
            int randPicker = (int)(Math.random()*characters.size());
            output.append(characters.remove(randPicker));
        }
        igc=new CountDownTimer(4000,1000) {
   
   @Override
   public void onTick(long arg0) {
    t1.setText(((arg0/1000))+"Secs ");
    t2.setText("Score: "+score);
    
   }
   
   @Override
   public void onFinish() {
    // TODO Auto-generated method stub
    dt1.setText("You Cannot ");
    dt2.setText("Complete ?");
    dt3.setText("You Scored: "+score);
    ob.show();
    upd();
    
   }
  }.start();
        chk=output.toString().charAt(0)+"";
        t3.setText(chk);
 }

The OnClick Function
public void onClick(View v) {
  // TODO Auto-generated method stub
  if(v.getId()==R.id.Button01)
  {
    if(ks.contains(chk))
    {
     igc.cancel();
     score+=3;
     calc();
    }
    else
    {
     igc.cancel();
     dt1.setText("You Think "+chk);
     dt2.setText("as Consonant ?");
     dt3.setText("You Scored: "+score);
     ob.show();
     upd();
    }
  }
  else if(v.getId()==R.id.button5)
  {
   if(os.contains(chk))
    {
    igc.cancel();
    score+=3;
    calc();
    }
    else
    {
     igc.cancel();
     dt1.setText("You Think "+chk);
     dt2.setText("as ODD ?");
     dt3.setText("You Scored: "+score);
     ob.show();
     upd();
    }
  }
  else if(v.getId()==R.id.Button02)
  {
   if(es.contains(chk))
    {
    igc.cancel();
     score+=3;
     calc();
    }
    else
    {
     igc.cancel();
     dt1.setText("You Think "+chk);
     dt2.setText("as EVEN ?");
     dt3.setText("You Scored: "+score);
     ob.show();
     upd();
    }
  }
  else if(v.getId()==R.id.button6)
  {
   if(vs.contains(chk))
    {
    igc.cancel();
     score+=3;
     calc();
    }
    else
    {
     igc.cancel();
     dt1.setText("You Think "+chk);
     dt2.setText("as VOWEL ?");
     dt3.setText("You Scored: "+score);
     ob.show();
     upd();
    }
  }
  else if(v.getId()==R.id.button1)
  {
   //Drawable d=getResources().getDrawable(R.drawable.play);
   igc.cancel();
   bp.setVisibility(View.GONE);
   is = new Button(v.getContext());
   is.setBackgroundResource(R.drawable.play);
   is.setOnClickListener(new OnClickListener() {
    
    public void onClick(View arg0) {
     // TODO Auto-generated method stub
     calc();
     is.setVisibility(View.GONE);
     bp.setVisibility(View.VISIBLE);
    }
   });
   ll.addView(is);
  }
  else if(v.getId()==R.id.button2)
  {
   Intent i= new Intent(this,GameActivity.class);
   startActivity(i);
   finish();
  }
  else if(v.getId()==R.id.imageView2)
  {
   finish();
  }
  else if(v.getId()==R.id.imageView3)
  {
   Intent i= new Intent(this,GameActivity.class);
   startActivity(i);
   finish();
  }
 }

Alternatively you can download the whole ADT Project by clicking here.
Found Bugs, Comment them here !

Comments

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t...
Read more

Hackerrank String Reduction Solution

By Sidharth Patnaik -
Image
This is the solution to the program, solved in python. The Question can be found in the Algorithm domain of Hackerrank. Problem Statement: Given a string consisting of letters, a, b and c, we can perform the following operation: Take any two adjacent distinct characters and replace them with the third character. For example, if 'a' and 'c' are adjacent, they can replaced by 'b'. Find the smallest string which we can obtain by applying this operation repeatedly? Screenshots[Demo] The Code: def cnt(x): m={} m['a']=0;m['b']=0;m['c']=0 for c in x: if c not in m: m[c]=1 else: m[c]+=1 return m def red(x): xm=cnt(x) print x,xm if((xm['a']==0 and xm['b']==0 ) or (xm['a']==0 and xm['c']==0 ) or (xm['b']==0 and xm['c']==0)): return len(x); if((xm['a']%2==0 and xm['b']%2==0 and xm['c']%2==0) or (...
Read more

Hackerrank Modified Kaprekar Numbers Solution

By Sidharth Patnaik -
Image
This is the solution to the Modified Kaprekar Numbers found in the implementation section of the algorithm domain in Hackerrank. A modified Kaprekar number is a positive whole number n with d digits, such that when we split its square into two pieces - a right hand piece r with d digits and a left hand piece l that contains the remaining d or d−1 digits, the sum of the pieces is equal to the original number (i.e. l + r = n) . Screenshot The Code def sendKap(x,s): y=x*x y=str(y) s1=y[:len(y)/2:] s2=y[len(y)/2::] s3=int(s1)+int(s2) if(s3==x): s.append(str(x)) st=input() en=input() s=[] for i in range(st,en+1): if(i>9): sendKap(i,s) elif(i==1): s.append(str(i)) elif(i==9): s.append(str(i)) if(len(s)==0): print 'INVALID RANGE' else: print ' '.join(s) Got any problems feel free to comment them here !
Read more