Monday, 25 December 2017

**Ultimate TH9 LavaLoon Strategy Guide**

Hey guys and gals of the attack strategy forums! I know a LOT of you have asked me in the past on my LavaLoonion guide thread to make an in depth guide to my favorite 3-star army for attacking th9 specifically. So I went and did just that. The video will also break this down but just so we have everything in both spaces I'll include the troops you'll need here as well.

This should work against MOST TH9 bases. And before you ask, I do not advocate luring clan castle on most bases before going in. Why? Because when using five lava hounds you really can afford to have them eat up the brunt of the CC damage. As you want them to die eventually anyway so the pups can help provide DPS for the attack. Also, you don't have to worry about minions bunching up on clan castle troops (which is one of the reasons to lure on a traditional lavaloonion / balloonion attack).

Here are the troops you'll need.

- 20 Balloons
- 4 Lava Hounds + 1 In clan castle (preferably max)
That's it!
Spells:
- 4 rage spells

For trips on troop deployment see the Trace and Holdback method of raid planning that I describe in detail in the video. Enjoy and feedback always welcome!

https://www.youtube.com/watch?v=EhTgtbk-5gE




Other guides here on the forums:
TH10 GoLava Three Star Guide
TH10 2 Star LavaLoonion Guide
Best TH10 War Bases


**Edit 3.20**
Another episode featuring more th9 LavaLoon three-star attacks, this time using lure.

https://www.youtube.com/watch?v=TVa8...qew3vebyp0kk0k


Monday, 18 December 2017


Hamming Code Implementation in C++


Hey guys i am uploading this program i made in my college today ,its simple hamming code word generation program for N bits data you enter and it will show you the code word 🙂

Hamming code is a popular error detection and error correction method in data communication. Hamming code can only detect 2 bit error and correct a single bit error which means it is unable to correct burst errors if may occur while transmission of data.
Please Like and share if helped for you , thanks
Enter any no of bits and get its hamming code !
This code is for even Piraty ,you may edit it and convert it to generate odd piraty .

C++ Implementation :

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include<iostream>
#include<stdlib.h>
#include<stdio.h>
#include<math.h>
using namespace std;
int main()
{
int a,b,c[30],d,r=0,d1;  //<strong> Max bits here i kept is 30</strong>
cout<<" Enter the No of Data Bits you want to Enter : "; cin>>a;
while(a+r+1>pow(2,r))
{ r++; }
cout<<"No of data bits to be added "<<r<<" : Total Bits :"<<a+r<<endl;
cout<<" Enter the Data Bits One by One :"<<endl;
for(int i=1;i<=a;++i) cin>>c[i];
cout<<endl<<" Data bits entered : ";
for(int i=1;i<=a;++i)
cout<<c[i]<<" ";
cout<<endl;
int data[a+r];
d=0;
d1=1;
for(int i=1;i<=a+r;++i)
{ if((i)==pow(2,d))
{data[i]=0;
++d;
}
else
{ data[i]=c[d1];
++d1;
}
}
cout<<" Data Bits are Encoded with Piraty bits(0): ";
for(int i=1;i<=a+r;++i)
cout<<data[i]<<" ";
d1=0; int min,max=0,piraty,s,j;
/*Parity Bit Calculation */
for(int i=1;i<=a+r;i=pow(2,d1))
{ ++d1; piraty=0; j=i;
s=i;
min=1;
max=i;
for( j;j<=a+r;) { for( s=j;max>=min && s<=a+r;++min,++s)
{ if(data[s]==1) piraty++;}
j=s+i;
min=1;
}
if(piraty%2==0)  // Even Parity
{ data[i]=0; }
else { data[i]=1; }
}
cout<<endl<<" Hamming codeword bits for even piraty are : ";
for(int i=1;i<=a+r;++i)
cout<<data[i]<<" ";
cout<<endl<<endl;
}      //End
Comment below if you have any queries related to above hamming code program in C++.
OutPut :
Screenshot_20171027_195501.png