Let’s play…I mean…create a prototype ’13’ deck aka Korean Poker!

If you are like me you played this addictive game at lunch, on the bus, during class…whatever you played it constantly because it’s seriously fun and a great way to pass the time. At Capo Valley, we loved this game because it was winnable even if you were dealt a shitty hand, the game encouraged a great deal of shit-talking and merriment. We’d also enhanced it with “insult rules” such as, while dealing, you throw a few of them face-up, just to piss off whoever you want to piss off. It also lended itself to so much cheating that we overlayed a rule; “If no one saw it, it wasn’t cheating.” Technically that is true in the absolute…the difference is that we encouraged cheating because it added more layers of fun, strategy, dexterity, options to win…the perfect game for college-prep band geeks who think to much and are fiercely competitive.

Common ways to cheat when you re the dealer is place a card you want on the bottom of the deck, dealing, 13 cards to each player beginning with west, you get the final card. Desirable cards include the 3 of clubs (whomever holds this card goes 1st…it is much like other games where whomever runs out 1st wins, going 1st on a good hand could end it). The ace of hearts is valued – any run ending in this card is unbeatable (thus you get to go again). Likewise, the 2 of hearts is valued for being the highest card – it is not unbeatable (a two-killer is a double-run-of-three such as 4,4,5,5,6,6) but it’s always nice to have, especially late in the game when most pairs and runs are likely to be all down. Another great way to cheat it to simply hide a card (or two, or more…) wherever you can hide it. The best place seemed to be under the left thigh or up my right sleeve. Another “layered” rule is that if you are caught cheating you forfeit the game (and winning if gambling is involved) – simply trying to look at other people’s cards is another surprisingly easy way cheat.

I won’t waste time with any more specific rules…most of you have never played it…still, the f-ed up ways to mess with the game applies to all of them (and that only scratches the surface) and you can apply the tenets and ideas in this post to YOUR preferred card game.

On topic – I’ve been brushing up on mu Java programming again so as a thought experiment I began to build a “Card” class (ADT, data-type, etc). Once I got that to work I decided to test it by creating an array (a list) of them and ordering them in the exact order they would go in 13. On higher level of this project are the following:

  1. A Deck Class
  2. A 13 Class
  3. A user-interface for the game itself

For now, I simply used my Card data-type to see if I could use a nested-for loop to populate the deck with cards as they from low to high in the game of 13. Software Engineers know that regardless of language, arrays begin at zero. In an object-oriented mode, I decided that “zero” had so little to do with cards/decks/card-games that I would use a place-holder for it. What else is not used…I mean…in actual card games? For most; the Joker(s), so in the interest of something w/in striking distance of elegant design; (in pseuodocode) 0=(string)”joker”
The following is the output from a Deck prototype, which hints at an actual 13 prototype, which is a thought rxp[eriment for the future…particularly the design of three players who can strategize against me…and..on an absurd level of abstraction…try to cheat me if the opportunity comes up and allow me to cheat the non-player-characters.

Below is the successful output from the v0 prototype of a 13-Deck
run:
whomever gets the 3 of spades goes first.
The following list will create a deck of 52 cards in ’13’ order
1. created the 3 of spades
2. created the 3 of clubs
3. created the 3 of diamonds
4. created the 3 of hearts
5. created the 4 of spades
6. created the 4 of clubs
7. created the 4 of diamonds
8. created the 4 of hearts
9. created the 5 of spades
10. created the 5 of clubs
11. created the 5 of diamonds
12. created the 5 of hearts
13. created the 6 of spades
14. created the 6 of clubs
15. created the 6 of diamonds
16. created the 6 of hearts
17. created the 7 of spades
18. created the 7 of clubs
19. created the 7 of diamonds
20. created the 7 of hearts
21. created the 8 of spades
22. created the 8 of clubs
23. created the 8 of diamonds
24. created the 8 of hearts
25. created the 9 of spades
26. created the 9 of clubs
27. created the 9 of diamonds
28. created the 9 of hearts
29. created the 10 of spades
30. created the 10 of clubs
31. created the 10 of diamonds
32. created the 10 of hearts
33. created the J of spades
34. created the J of clubs
35. created the J of diamonds
36. created the J of hearts
37. created the Q of spades
38. created the Q of clubs
39. created the Q of diamonds
40. created the Q of hearts
41. created the K of spades
42. created the K of clubs
43. created the K of diamonds
44. created the K of hearts
45. created the A of spades
46. created the A of clubs
47. created the A of diamonds
48. created the A of hearts
49. created the 2 of spades
50. created the 2 of clubs
51. created the 2 of diamonds
52. created the 2 of hearts
*QA test* The highest ranking card in 13 is the 2 of hearts
BUILD SUCCESSFUL (total time: 0 seconds)

It works! Created using the Netbeans IDE 8.0.2 on a win8.1 box using the Java SE 8 or Java 1.8 as I call it. SRC follows:

package card;
/** WIP - create a card ADT and enumerate it into a deck
* per "13" rules aka Korean Poker
* @author Tapper7.com last stable build - 12/15 &c ssstudios, los angeles, ca
*/
public class Card{
int suit;
int rank;
Card(){
this.suit = 0;
this.rank = 0;
}//null constr
Card(int suit, int rank){
this.suit = suit;
this.rank = rank;
}//fully-formed constructor to be used when a new card is instantiated
public static void showCard(Card theCard){
//cards are ranked as they are in 13 aka korean poker
//"jokers" hold null memory space so we arent using zeroes
String[] s = {"joker", "spades", "clubs", "diamonds", "hearts"};
String[] r = {"joker", "3", "4", "5", "6", "7", "8",
"9", "10", "J", "Q", "K", "A", "2"};
System.out.println(r[theCard.rank] + " of " + s[theCard.suit]);
}

public static void main(String[] args){
//create an array of cards
Card[] mydeck = new Card[54]; //array is oversized for debug
mydeck[0] = new Card(1,1);       //initialize
//test that the lowest card is created correctly
System.out.print(“whomever gets the “);
Card.showCard(mydeck[0]);
System.out.println(“goes first.”);
//populate the 13 deck in order fro m low to high
int currentCard = 1;
int suits = 1;
int ranks = 1;
System.out.println(“The following list will create a deck of 52 cards in ’13’ order”);
for(ranks = 1; ranks < 14; ranks++){//outerloop the ranks from 3 to 2
for(suits = 1; suits < 5; suits++){
mydeck[currentCard] = new Card(suits, ranks);
System.out.print(currentCard+”. “);
System.out.print(” created the “);
Card.showCard(mydeck[currentCard]);
currentCard++; //increment deck position
}//end inner loop
}//end outer loop
//test that the algorithm put the highest card in the correct index:
System.out.print(“*QA test* The highest ranking card in 13 is the “);
Card.showCard(mydeck[52]);
}//end mn
}//end prototype
thanks for stopping by! and now [below], a word form one of our sponsors

More fun with Java 1.8 -ASCII “Art” 101 using Arrays….

This is the type of assignment I would hand out to first year programming students. After introducing the idea of lists, I implore them to solve the following:
Use a list to build an ASCII pyramid using the character of your choice and make it: a) appear “pyramidal” that is, no leaning, no right-angles at the base and give it some semblance of aesthetic quality b) your logic should generate EVERY level of the pyramid, that is, no coding “special cases” for the top, middle or bottom rows. The logic must hold sound to construct the entire pyramid as a stand-alone algorithm. c) print your src (source code) and the output of your program to prove to peers that it works.

    This task requires careful dissection of the elements involved:

  • variable number of rows
  • each row knows how many spaces to print and how many characters
  • this involves logical analysis for the left spaces, the chars AND the right spaces
  • The algorithm must know when to “endline”/”newline”/
  • Careful analysis and monitoring (QA/QC) of the variables during runtime may be needed

For the seasoned programmer this is fairly basic, but involves core mathematical concepts, an element of basic aesthetic design and a good grip on list variable storage; how they are both computed and sent to an output stream (System.out in this case) This is the rough equivalent of “cout <<” for you C/C++ guys

    For extra credit:

  • Add a user-interface to ask the user how big to build the pyramid. Include exception-handling for pyramid sizes that are not technically “pyramids” (height = 1 is not a pyramid) heights too large will lose their aesthetic, or their pyramidal structure entirely if built too large or too impractical for the user’s display. (I capped mine at 50 rows) – add warnings depending on the user interface).
  • Decorate the pyramid with one or more random characters in addition to your “foundation” block (I used hashtags for my foundation block).
  • Invert the pyramid.
  • Stack the pyramid atop the inverted one to make a diamond shape…make sure it lines up evenly. No bumps or other strangeness in the middle.

Here is a sample solution; note that I carefully tracked line size, space, building-block-count, row-count & the storage of each…this is crucial to accuracy and QC testing during development time.
This is an acceptable output:

a snap of the pyramid program in-process using the Netbeans IDE
seen w/in the Netbeans Integrated Development Environment. “I design them.”

 

Here is the source code – note brevity in my solution– ~20 lines-ungolfed!:
/*
author: Chris "Tapper" Welke
This program generates an ASCII-art 50 row pyramid using hashtags as a building block.
Solution provided for instructional/informational purposes in the areas of lists,
integers, type-casting, dynamic memory allocation, and open-source programming. If you
are new to Java, this is an excellent trial pgm to get you started.
Dist. under the GNU Public License. Free to distribute: please attribute though, ok?:
Last Stable Build: 5/23/15 at Tapper7.com and Self-Similarity Studios courtesy
The Netbeans (Netbeans.org) IDE, Java 1.8 and the std. javac compiler
OS: Win 8.1, Chipset by Intel. Laptop by Hewlett-Packard. Website provided by Media Temple
*/
package learn;
import java.util.Arrays;
public class HashTagASCIIPyramid{
protected static int charlinelength = 100;
public static void main(String[] arg){
float[] asciiStorage = new float[HashTagASCIIPyramid.charlinelength];
int totalHashtags = 1; //initialize builing block total
int charCount = 0; //count building blocks for QC testing
int[] cclist = new int[100]; //record the char generation as it happens
int leftspaces = (int)asciiStorage.length/2;
int rightspaces = (int)asciiStorage.length/2;
int height = 1;
for(int i = 0; i < asciiStorage.length/2; i++){
for (int l = 0; l < leftspaces; l++){
System.out.print(" "); charCount++;
}
for (int t = 0; t < totalHashtags; t++){
System.out.print("#"); charCount++;
}
for (int r = 0; r < rightspaces; r++){
System.out.print(" "); charCount++;
}
System.out.print('\n');
/*QC Tracking: height++; cclist[i] = charCount;*/
leftspaces--; totalHashtags +=2;rightspaces--;
}//end mn loop
}//end mn
}//end class #asciipyramid

Hints: I used space-fillers for the spaces (” “); – left and right brackets plus lots of variable outputs to see what was going on during run-time, my initial design yielded the following output:
run:
pyramid test1
WHOOPS!
Heh…so clearly there were multiple logic faults, (and I started with tildas, not hashtags….) but it was easy to track the movement of the left and right brackets that debugged the left and right SPACES and not shown are my debugging outputs that checked the length of each row for consistency(it was going over and under 100 – keeping the length of each row equivalent was key to my particular legitimate solution)— also that my iterators and arrays were misplaced and thus not controlling and the output correctly.

    Keys to victory:

  1. increment blocks by TWO; not one
  2. decrement spaces and increment blocks OUTSIDE the main loop rightSpaces--;leftSpaces--totalHashtags+=2;

Coming soon: Bill’s adventures at Los Alamos, More Netbeans experiments, tutorials and anything interesting that happens when I have my camera on me.

Lots of great ideas in the works…and let us not forget: Summer is Coming …. Go Santa Clara and Concord! Support your local drum corps by playing bingo, going to shows, donating your time, tailgating at shows and screaming your lungs out when corps brings you to it on the Field of Honor. All signs point to a another stellar season for Red and Blue Banners both; and I wouldn’t have it any other way (scratch that….I’d resurrect Bridgemen, Suncoast, Big 27, Star, Kingsmen, The Freelancers and The Velvet Knights) THEN it’d be roll-out time.
Under the circumstances, putting all politics aside; Thank God for Rosemont, Rockford, Madison, Garfield, Bloooooo, SCV/BD, Cru, Spirit and all other remamining “Big Time DCI” corps still in the hunt, still rockin’ it…gettin ready for the only kickoff I really care about: Memorial Day Weekend. A trial by fire where those who make it through will be ready for the best summer of their lives. Hang in there kids, you got this!
Music, Tech, Art, Love and Life; find it all right here at The SoCal Picayune. Your LA/OC home for Drum Corps, Culture, tech-security, experiments and solutions, the occasional off-color joke, scam-hunting, YT highlights and the best (and worst) direct from the minds of this writer, Tapper and Bill Feynman.
Maybe a Memorial Day Anecdote will inspire itself as we begin the approach. hmmmmm…..
[] Support my sponsors! All are reviewed regularly for legitimacy by the Senior Ethics Auditor: moi

The Binary Power Series and Java 1.8 ….

A numeric depiction of 18.44 Quintillion

Series follow a specific pattern and obey explicit, ineffable rules, like prime numbers….
1, 3, 5, 7, 11, 13, 17, 19, 23…. Or a times-table such as 9…. 18, 27, 36, 45, 54, 63, 72, 81, 90, 99. You get the idea, right? (I hope so or you’ll find this post incredibly boring).
Computers store information in bits. A bit is one memory cell that is known by the CPU to be TRUE or FALSE, one or zero. In the parlance of electrical engineering, this equates to either “very very low voltage” or “hardly any voltage at all.”
A byte is eight bits: 0000 0000 thru 1111 1111; 1-256

Consider 0000, 0001, 0010, 0011, 0100, 0101, 0111, 1111 -OR- (in English) one, two, three, four five six, seven, eight. To be literal, it’s actually zero through seven, but let’s not get muddy the waters or scare off any readers due to the “maths.” You don’t need to know much math to understand this information…. So a computer needs half of one byte in order to express “seven” to the world “1111.”

Eight bits comprises two to the eighth power (256) possible binary combos. That’s enough to create a color palette acceptable to the human eye, In RGB-space, three eight-bit numbers (0,0,0) being “K” or Black and (255,255,255) being White – or is it vice-versa? You can always go to www.org for quick reference on non-abstract, “code flavors” such as the above assertion. Ok, so three SETs of 256 bits can broadcast “Game of Thrones” on your laptop screen adequaetely. This is what makes 64-bit machines so exciting…64 is a small number….2^64 (which is the definition of a 64-bit sys) ACTUALLY equals about 18.5 QUINTILLION, or 18.5 x a trillion x a trillion. To give you an idea of size…if you started counting as fast as you could from the time you could speak…or comprehend it and count in your head; if you lived an avg. lifespan (~72.9 yrs) you’d be spitting out “one billion” with your last dying breath. A 64-bit system can express and count to a billion in fractions of a millisecond. So what concerns us about this TODAY?
With big data (all the rage) comes big numbers, so I’ve been thinking about them and toying with the limits of large number calculation and output using my laptop’s on-board calculator…it can express a google correctly using a semi-correct scientific notation: “1.e+100” –by that, Microsoft means to say “a one followed by 100 zeroes.” I have no way of knowing HOW they arrive at a correct answer to 10^100 considering that the largest unsigned long integer that can be stored in one memory cell by a 64-bit system is stated above..”a 1 followed by 19 numbers” … this means the Calculator App you use combines multiple long integers and uses extra memory to store anything above 2^64 = 18,446,744,073,709,551,616.

Using the Netbeans IDE, I created a program that asks the user to provide a number to act as a power of two. It then calculates and prints the subsequent results to the screen. Integers are preffered because they are fast, accurate and take up very little memory: 16 bits or 2 bytes, which can express numbers on the range of (-32678 to +32678). Integers (or “ints”) can ONLY BE WHOLE NUMBERS, that is, 1.5 is not an int, nor is e or pie or the square root of two.

Program output for common cases:
How many iterations of the Binary Power Series would you like to see calculated and printed?
0
Ok - you're the boss. No iterations--> no output
How many iterations of the Binary Power Series would you like to see calculated and printed?
1
Binary Power Series 2 to the power of 0 = 1
BUILD SUCCESSFUL (total time: 6 seconds)
How many iterations of the Binary Power Series would you like to see calculated and printed?
2
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
BUILD SUCCESSFUL (total time: 4 seconds)
How many iterations of the Binary Power Series would you like to see calculated and printed?
4
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
BUILD SUCCESSFUL (total time: 6 seconds)
How many iterations of the Binary Power Series would you like to see calculated and printed?
8
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
Binary Power Series 2 to the power of 4 = 16
Binary Power Series 2 to the power of 5 = 32
Binary Power Series 2 to the power of 6 = 64
Binary Power Series 2 to the power of 7 = 128
BUILD SUCCESSFUL (total time: 15 seconds)

How many iterations of the Binary Power Series would you like to see calculated and printed?
16
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
Binary Power Series 2 to the power of 4 = 16
Binary Power Series 2 to the power of 5 = 32
Binary Power Series 2 to the power of 6 = 64
Binary Power Series 2 to the power of 7 = 128
Binary Power Series 2 to the power of 8 = 256
Binary Power Series 2 to the power of 9 = 512
Binary Power Series 2 to the power of 10 = 1024
Binary Power Series 2 to the power of 11 = 2048
Binary Power Series 2 to the power of 12 = 4096
Binary Power Series 2 to the power of 13 = 8192
Binary Power Series 2 to the power of 14 = 16384
Binary Power Series 2 to the power of 15 = 32768
BUILD SUCCESSFUL (total time: 3 seconds)
How many iterations of the Binary Power Series would you like to see calculated and printed?
32
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
Binary Power Series 2 to the power of 4 = 16
Binary Power Series 2 to the power of 5 = 32
Binary Power Series 2 to the power of 6 = 64
Binary Power Series 2 to the power of 7 = 128
Binary Power Series 2 to the power of 8 = 256
Binary Power Series 2 to the power of 9 = 512
Binary Power Series 2 to the power of 10 = 1024
Binary Power Series 2 to the power of 11 = 2048
Binary Power Series 2 to the power of 12 = 4096
Binary Power Series 2 to the power of 13 = 8192
Binary Power Series 2 to the power of 14 = 16384
Binary Power Series 2 to the power of 15 = 32768
Binary Power Series 2 to the power of 16 = 65536
Binary Power Series 2 to the power of 17 = 131072
Binary Power Series 2 to the power of 18 = 262144
Binary Power Series 2 to the power of 19 = 524288
Binary Power Series 2 to the power of 20 = 1048576
Binary Power Series 2 to the power of 21 = 2097152
Binary Power Series 2 to the power of 22 = 4194304
Binary Power Series 2 to the power of 23 = 8388608
Binary Power Series 2 to the power of 24 = 16777216
Binary Power Series 2 to the power of 25 = 33554432
Binary Power Series 2 to the power of 26 = 67108864
Binary Power Series 2 to the power of 27 = 134217728
Binary Power Series 2 to the power of 28 = 268435456
Binary Power Series 2 to the power of 29 = 536870912
Binary Power Series 2 to the power of 30 = 1073741824
Binary Power Series 2 to the power of 31 = 2147483648
BUILD SUCCESSFUL (total time: 4 seconds)

….now let’s see what happens when we get close to 64 iterations:

How many iterations of the Binary Power Series would you like to see calculated and printed?
63
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
Binary Power Series 2 to the power of 4 = 16
Binary Power Series 2 to the power of 5 = 32
Binary Power Series 2 to the power of 6 = 64
Binary Power Series 2 to the power of 7 = 128
Binary Power Series 2 to the power of 8 = 256
Binary Power Series 2 to the power of 9 = 512
Binary Power Series 2 to the power of 10 = 1024
Binary Power Series 2 to the power of 11 = 2048
Binary Power Series 2 to the power of 12 = 4096
Binary Power Series 2 to the power of 13 = 8192
Binary Power Series 2 to the power of 14 = 16384
Binary Power Series 2 to the power of 15 = 32768
Binary Power Series 2 to the power of 16 = 65536
Binary Power Series 2 to the power of 17 = 131072
Binary Power Series 2 to the power of 18 = 262144
Binary Power Series 2 to the power of 19 = 524288
Binary Power Series 2 to the power of 20 = 1048576
Binary Power Series 2 to the power of 21 = 2097152
Binary Power Series 2 to the power of 22 = 4194304
Binary Power Series 2 to the power of 23 = 8388608
Binary Power Series 2 to the power of 24 = 16777216
Binary Power Series 2 to the power of 25 = 33554432
Binary Power Series 2 to the power of 26 = 67108864
Binary Power Series 2 to the power of 27 = 134217728
Binary Power Series 2 to the power of 28 = 268435456
Binary Power Series 2 to the power of 29 = 536870912
Binary Power Series 2 to the power of 30 = 1073741824
Binary Power Series 2 to the power of 31 = 2147483648
Binary Power Series 2 to the power of 32 = 4294967296
Binary Power Series 2 to the power of 33 = 8589934592
Binary Power Series 2 to the power of 34 = 17179869184
Binary Power Series 2 to the power of 35 = 34359738368
Binary Power Series 2 to the power of 36 = 68719476736
Binary Power Series 2 to the power of 37 = 137438953472
Binary Power Series 2 to the power of 38 = 274877906944
Binary Power Series 2 to the power of 39 = 549755813888
Binary Power Series 2 to the power of 40 = 1099511627776
Binary Power Series 2 to the power of 41 = 2199023255552
Binary Power Series 2 to the power of 42 = 4398046511104
Binary Power Series 2 to the power of 43 = 8796093022208
Binary Power Series 2 to the power of 44 = 17592186044416
Binary Power Series 2 to the power of 45 = 35184372088832
Binary Power Series 2 to the power of 46 = 70368744177664
Binary Power Series 2 to the power of 47 = 140737488355328
Binary Power Series 2 to the power of 48 = 281474976710656
Binary Power Series 2 to the power of 49 = 562949953421312
Binary Power Series 2 to the power of 50 = 1125899906842624
Binary Power Series 2 to the power of 51 = 2251799813685248
Binary Power Series 2 to the power of 52 = 4503599627370496
Binary Power Series 2 to the power of 53 = 9007199254740992
Binary Power Series 2 to the power of 54 = 18014398509481984
Binary Power Series 2 to the power of 55 = 36028797018963968
Binary Power Series 2 to the power of 56 = 72057594037927936
Binary Power Series 2 to the power of 57 = 144115188075855872
Binary Power Series 2 to the power of 58 = 288230376151711744
Binary Power Series 2 to the power of 59 = 576460752303423488
Binary Power Series 2 to the power of 60 = 1152921504606846976
Binary Power Series 2 to the power of 61 = 2305843009213693952
Binary Power Series 2 to the power of 62 = 4611686018427387904

Sixty-four is the borderline on accuracy using unsigned long integers (as stated above) so I coded it’s calculation and warning appropriately:

How many iterations of the Binary Power Series would you like to see calculated and printed?
64
Binary Power Series 2 to the power of 0 = 1
Binary Power Series 2 to the power of 1 = 2
Binary Power Series 2 to the power of 2 = 4
Binary Power Series 2 to the power of 3 = 8
Binary Power Series 2 to the power of 4 = 16
Binary Power Series 2 to the power of 5 = 32
Binary Power Series 2 to the power of 6 = 64
Binary Power Series 2 to the power of 7 = 128
Binary Power Series 2 to the power of 8 = 256
Binary Power Series 2 to the power of 9 = 512
Binary Power Series 2 to the power of 10 = 1024
Binary Power Series 2 to the power of 11 = 2048
Binary Power Series 2 to the power of 12 = 4096
Binary Power Series 2 to the power of 13 = 8192
Binary Power Series 2 to the power of 14 = 16384
Binary Power Series 2 to the power of 15 = 32768
Binary Power Series 2 to the power of 16 = 65536
Binary Power Series 2 to the power of 17 = 131072
Binary Power Series 2 to the power of 18 = 262144
Binary Power Series 2 to the power of 19 = 524288
Binary Power Series 2 to the power of 20 = 1048576
Binary Power Series 2 to the power of 21 = 2097152
Binary Power Series 2 to the power of 22 = 4194304
Binary Power Series 2 to the power of 23 = 8388608
Binary Power Series 2 to the power of 24 = 16777216
Binary Power Series 2 to the power of 25 = 33554432
Binary Power Series 2 to the power of 26 = 67108864
Binary Power Series 2 to the power of 27 = 134217728
Binary Power Series 2 to the power of 28 = 268435456
Binary Power Series 2 to the power of 29 = 536870912
Binary Power Series 2 to the power of 30 = 1073741824
Binary Power Series 2 to the power of 31 = 2147483648
Binary Power Series 2 to the power of 32 = 4294967296
Binary Power Series 2 to the power of 33 = 8589934592
Binary Power Series 2 to the power of 34 = 17179869184
Binary Power Series 2 to the power of 35 = 34359738368
Binary Power Series 2 to the power of 36 = 68719476736
Binary Power Series 2 to the power of 37 = 137438953472
Binary Power Series 2 to the power of 38 = 274877906944
Binary Power Series 2 to the power of 39 = 549755813888
Binary Power Series 2 to the power of 40 = 1099511627776
Binary Power Series 2 to the power of 41 = 2199023255552
Binary Power Series 2 to the power of 42 = 4398046511104
Binary Power Series 2 to the power of 43 = 8796093022208
Binary Power Series 2 to the power of 44 = 17592186044416
Binary Power Series 2 to the power of 45 = 35184372088832
Binary Power Series 2 to the power of 46 = 70368744177664
Binary Power Series 2 to the power of 47 = 140737488355328
Binary Power Series 2 to the power of 48 = 281474976710656
Binary Power Series 2 to the power of 49 = 562949953421312
Binary Power Series 2 to the power of 50 = 1125899906842624
Binary Power Series 2 to the power of 51 = 2251799813685248
Binary Power Series 2 to the power of 52 = 4503599627370496
Binary Power Series 2 to the power of 53 = 9007199254740992
Binary Power Series 2 to the power of 54 = 18014398509481984
Binary Power Series 2 to the power of 55 = 36028797018963968
Binary Power Series 2 to the power of 56 = 72057594037927936
Binary Power Series 2 to the power of 57 = 144115188075855872
Binary Power Series 2 to the power of 58 = 288230376151711744
Binary Power Series 2 to the power of 59 = 576460752303423488
Binary Power Series 2 to the power of 60 = 1152921504606846976
Binary Power Series 2 to the power of 61 = 2305843009213693952
Binary Power Series 2 to the power of 62 = 4611686018427387904
Binary Power Series 2 to the power of 63 = -9223372036854775808
The longest integer that can be expressed correctly is 4611686018427387904
appx. 4.61 QUINTILLION (4.61E18)
***Requests for over 64 iterations return bad data***
BUILD SUCCESSFUL (total time: 3 seconds)

Note that the 64th iteration (array in location 63 is NEGATIVE…this is obviously not the correct answer. I capped the size of the long int array at 65 memory cells, hence …while it WILL compile (using the std gcc compiler) it will throw an exception and kill the program for values OVER 64:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 65
Here is the source code I wrote if you’d like to try out my logic, tweak it, or scope-out my old-school design style (it is only lightly code-golfed; the abbreviations the kids use today make for confusing code. I try to use Object-Oriented variable identifiers to make definitive and concise use of comments as well as a style I learned from my days as a Cal Poly CSC Code-monkey:

/* Author: Chris "Tapper" Welke
* dist under the GNU Public License.
* This program tests the upper limit of numbers (long ints)
* of the NetBeans IDE v8.0.2 via the rapid geometric growth
* inherent to The Binary Power Series (BPS). 1, 2, 4, 8, 16 ....
* Two to the 64th power is the highest integer in the series
* it can calculate correctly unaided by extra memory/variables/logic
* Last stable build at Self-Similarity Studios & Tapper7.com,
* Los Angeles, CA 5/15/2015
*/
package series;
import java.util.Scanner;
class BPSeries{
protected static String Name = "Binary Power Series ";
protected static int Base = 2;
public static int gIN(){/**
* This fxn gets and sets the number of BPS iterations from the user
* a warning is displayed for n = 64 and an exception is thrown for n > 64
*/
int userInput;
System.out.println("How many iterations of the " + Name + "would you like to see calculated and printed?");
Scanner in = new Scanner(System.in);
userInput = in.nextInt();
return userInput;
}//end UI gIN
public static void main(String[] arg){
//getNset user-defined number of iterations:
int sIts = BPSeries.gIN();
//declare and allocate space for the cells
int cellKit = 65; //throw exception for >64 pwrs of 2
long[] sCells = new long[cellKit];
int pwr = 0; //initialize superscript
int i = 1; //initialize cell iterator
sCells[0] = 0; //null
sCells[1] = 1; //set cell one to 1 since n^0 = 1 for all n
switch(sIts){
case 0:
System.out.println("Ok - you're the boss. No iterations--> no output");
break;
case 1:
System.out.println(BPSeries.Name + BPSeries.Base + " to the power of " +pwr+ " = "+sCells[i]);
i++; pwr++;
break;
default:
System.out.println(BPSeries.Name + BPSeries.Base +" to the power of 0 = 1");
sCells[3]=(sCells[2]*BPSeries.Base);
i++; pwr++;
while (i<=sIts){ sCells[i]= (sCells[i-1] * BPSeries.Base); System.out.println(BPSeries.Name + BPSeries.Base + " to the power of "+pwr+" = "+sCells[i]); i++; pwr++; }//end while if(sIts>63){//exception notification/handling for 64 bit chipset
System.out.println("The longest integer that can be expressed correctly is "+ sCells[63]);
System.out.println("appx. 4.61 QUINTILLION (4.61E18)");
System.out.println("***Requests for over 64 iterations return bad data***");
}//endIF
}//end switch
}//end main
}//end BPS

A graphical analysis and more tests will follow this discussion; as well as highlights from
The Doheny Blues Festival, which begins tomorrow, I will review Boz Scaggs and hopefully Los Lobos too. Come get your tap on w/ me this weekend. Boz Scaggs!!! []

Today’s algorithm and number-musings sponsored by: