The Fake Geek's blog: The 100 Game


The Fake Geek's blog: The 100 Game
In "the 100 game," two players take turns adding, to a running 
total, any integer from 1..10. The player who first causes the running 
total to reach or exceed 100 wins. 
What if we change the game so that players cannot re-use integers? 
For example, if two players might take turns drawing from a common pool of numbers 
of 1..15 without replacement until they reach a total >= 100. This problem is 
to write a program that determines which player would win with ideal play. 

Write a procedure, "Boolean canIWin(int maxChoosableInteger, int desiredTotal)", 
which returns true if the first player to move can force a win with optimal play. 

Your priority should be programmer efficiency; don't focus on minimizing 
either space or time complexity. 
*/ 

Boolean canIWin(int maxChoosableInteger, int desiredTotal) { 
// Implementation here. Write yours 

}
This is a very interesting problem. Here is the heat discussion on Careercup. Overall, I don't think there is an optimal strategy, especially from the beginning of the game. So, just for fun, I include some randomness in to the game.

1. My code prints out all possible results of every start number from 1 to maxChoosableInteger assuming at the beginning of the game, there is no optimal strategy. 
2. There is no guarantee that starts from any number that P1 will win or P1 will lose. 
3. If the winnerNumber = (desiredTotal - currentSum) is in the range (1, maxChoosableInteger) and if  the winnerNumber hasn't been chosen, the current player will choose that number and she will win. 
4. If the winnerNumber has already been chosen, the current player will choose the smallest number available in order to prolong the game. 
5. If there is no winnerNumber, i.e., desiredTotal - currentSum isn't in the range (1, maxChoosableInteger), if the last player chose a small number (I classify "small" as number in the range (1, maxChoosableInteger/2)), the current player will choose a large number (range(maxChoosableInteger/2, maxChoosableInteger)), randomly (actually the assumption is not completely true). Otherwise she will choose a small number. Note if no such random number she can choose, she will choose the largest or smallest number available, respectively. 

I don't think my algorithm is the best one, some assumptions is not strict enough, but it's a little better than naive assumption of always choosing the largest number... I guess... 
 public void canIWin(int maxChooseableInteger, int desiredTotal) {
  if ((maxChooseableInteger*maxChooseableInteger + maxChooseableInteger) / 2 < desiredTotal) {
   throw new IllegalArgumentException("Wrong input!");
  }
  boolean[] pool = new boolean[maxChooseableInteger];
  for (int i = 0; i < maxChooseableInteger; i++) {
   System.out.println("If I start with: " + (i + 1));
   pool[i] = true;
   canP1Win(i + 1, i + 1, maxChooseableInteger, desiredTotal, pool, true);
    System.out.println("*******************");
   pool = new boolean[maxChooseableInteger];
  }
 }
 boolean canP1Win(int lastNumber, int currentSum, int maxChooseableInteger,
   int total, boolean[] pool, boolean isLastP1) {
  if (currentSum >= total) {
   if (isLastP1)
    System.out.println("I can win!");
   else
    System.out.println("I will lose... :(");
   return isLastP1;
  }
  boolean isCurrentPlayerP1 = !isLastP1;
  int index;
  if (total - currentSum <= maxChooseableInteger) {
   index = maxChooseableInteger - 1;
   while (index >= 0 && pool[index]) {
    index--;
   }
   if (index < 0)
    return isCurrentPlayerP1;
   if ((currentSum + index + 1) >= total) {
    if (isCurrentPlayerP1)
     System.out.println("I can win with: " + (index + 1));
    else
     System.out.println("I will lose with: " + (index + 1) + " :'(");
    return isCurrentPlayerP1;
   }
   //if the current player cannot win, she will choose a strategy not to let the opponent win
   index = 0;
   while (pool[index]) {
    index++;
   }
  }
  else {
   Random r = new Random();
   if (lastNumber <= maxChooseableInteger / 2){
    index = r.nextInt(maxChooseableInteger / 2 + 1) + maxChooseableInteger/2;
    int count = 0;
    while ((pool[index] || index > maxChooseableInteger - 1 ) && count <= maxChooseableInteger) {
     index = r.nextInt(maxChooseableInteger / 2 + 1) + maxChooseableInteger/2;
     count++;
    }
    while (index >= 0 && pool[index]) {
     index--;
    }
    if (index < 0)
     return isCurrentPlayerP1;
   }
   else {
    index = r.nextInt(maxChooseableInteger / 2);
    int count = 0;
    while(pool[index] && count <= maxChooseableInteger) {
     index = r.nextInt(maxChooseableInteger / 2);
    }
    while (pool[index]) {
     index++;
    }
    //System.out.println("3 index: " + (index + 1));
   }
  }
  if (isCurrentPlayerP1)
   System.out.println("I will choose " + (index + 1));
  else
   System.out.println("The oponent chooses: " + (index + 1));
  pool[index] = true;
  boolean p1CanWin = canP1Win(index + 1, currentSum + index + 1, maxChooseableInteger, total,
    pool, isCurrentPlayerP1);
  if (isCurrentPlayerP1 && p1CanWin)
   return true;
  if (!isCurrentPlayerP1 && !p1CanWin)
   return false;
  pool[index] = false;
  return isCurrentPlayerP1 ? false : true;
 }
Read full article from The Fake Geek's blog: The 100 Game

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts