☰

BvS Synchro Helper

BvS WorldKai Synchro Helper 1.3

目前为 2017-05-19 提交的版本。查看 最新版本。

  1. // ==UserScript==
  2. // @name           BvS Synchro Helper
  3. // @namespace      rvBvS
  4. // @description    BvS WorldKai Synchro Helper 1.3
  5. // @include        http*://*animecubed.com/billy/bvs/worldkaiju-group.html
  6. // @version        1.4
  7. // @history        1.4 Now https compatible (Updated by Channel28)
  8. // @history        1.3 Made more compliant
  9. // ==/UserScript==
  10.  
  11. const GMSTORAGE_PATH = "BvS_Synchro_";
  12.  
  13.  
  14. var match;
  15. 	
  16. var possibilities = [];
  17. var guesses = [];
  18. var responses = [];
  19. var previousGuesses = [];	//guess1, guess2, guess3, guess4, correct, wrong position
  20.  
  21. var elementDisplay = ["Fire", "Lightning", "Water", "Earth", "Wind", "RNG", "Awesome", "Code", "XXXX"];
  22. var reverseElements = {"Fire" : 0, "Lightning" : 1, "Water" : 2, "Earth" : 3, "Wind" : 4, "RNG" : 5, "Awesome" : 6, "Code" : 7, "XXXX" : 8};
  23. var standardFirstGuess = null;
  24. var legacyHelp;
  25. var guess = null;
  26.  
  27. var element1;
  28. var element2;
  29. var element3;
  30. var element4;
  31.  
  32. var numberofcolors;
  33. var possibilitiesleft = null;
  34. var allowpossibilitiesdisplay = false;
  35. var possibilitydisplaypage = 0;
  36.  
  37. function load(ev) {
  38. 	try {
  39. 		var temp = document.getElementsByName("c1");
  40. 		if ((temp != null) && (temp.length > 0)) {
  41. 			element1 = temp[0];
  42. 			element2 = document.getElementsByName("c2")[0];
  43. 			element3 = document.getElementsByName("c3")[0];
  44. 			element4 = document.getElementsByName("c4")[0];
  45.  
  46. 			numberofcolors = element1.options.length;
  47.  
  48. 			legacyHelp = getLegacyHelp();
  49. 	
  50. 			getPreviousGuesses();
  51.  
  52. 			if (previousGuesses.length <= 1) {
  53. 				if (legacyHelp == null) {
  54. 					switch (numberofcolors) {
  55. 					case 1: standardFirstGuess = [0, 0, 0, 0];	break;
  56. 					case 2: standardFirstGuess = [0, 0, 1, 1];	break;
  57. 					case 3: standardFirstGuess = [0, 0, 0, 1];	break;
  58. 					case 4: standardFirstGuess = [0, 0, 1, 2];	break;
  59. 					case 5: standardFirstGuess = [0, 0, 1, 1];	break;
  60. 					case 6: standardFirstGuess = [0, 0, 1, 1];	break;
  61. 					case 7: standardFirstGuess = [0, 1, 2, 3];	break;
  62. 					case 8: standardFirstGuess = [0, 1, 2, 3];	break;
  63. 					}
  64. 				} else {
  65. 					switch (numberofcolors) {
  66. 					case 2: standardFirstGuess = [0, 0, 0, 1];	break;
  67. 					case 3: standardFirstGuess = [1, 0, 0, 2];	break;
  68. 					case 4: standardFirstGuess = [1, 0, 1, 2];	break;
  69. 					case 5: standardFirstGuess = [1, 2, 3, 4];	break;
  70. 					case 6: standardFirstGuess = [1, 1, 2, 2];	break;
  71. 					case 7: standardFirstGuess = [1, 0, 2, 3];	break;
  72. 					case 8: standardFirstGuess = [1, 2, 3, 4];	break;
  73. 					}
  74. 	
  75. 					if (standardFirstGuess != null) {
  76. 						standardFirstGuess[0] += legacyHelp;
  77. 						standardFirstGuess[1] += legacyHelp;
  78. 						standardFirstGuess[2] += legacyHelp;
  79. 						standardFirstGuess[3] += legacyHelp;
  80. 	
  81. 						standardFirstGuess[0] %= numberofcolors;
  82. 						standardFirstGuess[1] %= numberofcolors;
  83. 						standardFirstGuess[2] %= numberofcolors;
  84. 						standardFirstGuess[3] %= numberofcolors;
  85. 					}
  86. 				}
  87. 			}
  88. 	
  89. 			if ((previousGuesses.length == 0) && (standardFirstGuess != null)) {
  90. 				guess = standardFirstGuess;
  91. 	
  92. 				if (legacyHelp == null)
  93. 					possibilitiesleft = numberofcolors * numberofcolors * numberofcolors * numberofcolors;
  94. 				else
  95. 					possibilitiesleft = (numberofcolors - 1) * numberofcolors * numberofcolors * numberofcolors;
  96. 			} else if ((previousGuesses.length == 1) && (numberofcolors >= 4) && (numberofcolors <= 8) && (compareArray(previousGuesses[0], standardFirstGuess, 4))) {
  97. 				var index = Math.floor((previousGuesses[0][4] * 11 - previousGuesses[0][4] * previousGuesses[0][4]) / 2) + previousGuesses[0][5];
  98.  
  99. 				if (legacyHelp == null) {
  100. 					switch (numberofcolors) {
  101. 					case 4:
  102. 						switch (index) {
  103. 						case 0: guess = [3, 3, 3, 3];	possibilitiesleft = 1;		break;
  104. 						case 1: guess = [3, 3, 1, 3];	possibilitiesleft = 16;		break;
  105. 						case 2: guess = [3, 3, 0, 1];	possibilitiesleft = 42;		break;
  106. 						case 3: guess = [1, 3, 2, 0];	possibilitiesleft = 20;		break;
  107. 						case 4: guess = [1, 2, 0, 0];	possibilitiesleft = 2;		break;
  108. 						case 5: guess = [0, 3, 2, 3];	possibilitiesleft = 18;		break;
  109. 						case 6: guess = [0, 3, 0, 3];	possibilitiesleft = 46;		break;
  110. 						case 7: guess = [0, 1, 2, 1];	possibilitiesleft = 40;		break;
  111. 						case 8: guess = [0, 1, 2, 0];	possibilitiesleft = 4;		break;
  112. 						case 9: guess = [0, 3, 0, 3];	possibilitiesleft = 29;		break;
  113. 						case 10:guess = [0, 1, 1, 0];	possibilitiesleft = 20;		break;
  114. 						case 11:guess = [0, 1, 0, 2];	possibilitiesleft = 5;		break;
  115. 						case 12:guess = [0, 1, 1, 3];	possibilitiesleft = 12;		break;
  116. 						}
  117. 						break;
  118. 					case 5:
  119. 						switch (index) {
  120. 						case 0: guess = [2, 2, 2, 3];	possibilitiesleft = 81;		break;
  121. 						case 1: guess = [1, 2, 0, 2];	possibilitiesleft = 108;	break;
  122. 						case 2: guess = [1, 2, 0, 3];	possibilitiesleft = 54;		break;
  123. 						case 3: guess = [0, 1, 0, 2];	possibilitiesleft = 12;		break;
  124. 						case 4: guess = [1, 1, 0, 0];	possibilitiesleft = 1;		break;
  125. 						case 5: guess = [0, 2, 1, 2];	possibilitiesleft = 108;	break;
  126. 						case 6: guess = [0, 2, 0, 0];	possibilitiesleft = 120;	break;
  127. 						case 7: guess = [0, 1, 0, 2];	possibilitiesleft = 28;		break;
  128. 						case 8:	break;
  129. 						case 9: guess = [0, 2, 0, 2];	possibilitiesleft = 68;		break;
  130. 						case 10:guess = [0, 1, 1, 2];	possibilitiesleft = 24;		break;
  131. 						case 11:guess = [0, 1, 0, 2];	possibilitiesleft = 4;		break;
  132. 						case 12:guess = [0, 0, 2, 3];	possibilitiesleft = 16;		break;
  133. 						}
  134. 						break;
  135. 					case 6:
  136. 						switch (index) {
  137. 						case 0: guess = [2, 2, 3, 4];	possibilitiesleft = 256;	break;
  138. 						case 1: guess = [1, 2, 3, 3];	possibilitiesleft = 256;	break;
  139. 						case 2: guess = [1, 2, 3, 3];	possibilitiesleft = 96;		break;
  140. 						case 3: guess = [0, 1, 0, 2];	possibilitiesleft = 16;		break;
  141. 						case 4: guess = [1, 1, 0, 0];	possibilitiesleft = 1;		break;
  142. 						case 5: guess = [0, 2, 3, 3];	possibilitiesleft = 256;	break;
  143. 						case 6: guess = [0, 0, 2, 3];	possibilitiesleft = 208;	break;
  144. 						case 7: guess = [0, 1, 0, 2];	possibilitiesleft = 36;		break;
  145. 						case 8:	break;
  146. 						case 9: guess = [0, 1, 2, 3];	possibilitiesleft = 114;	break;
  147. 						case 10:guess = [0, 1, 1, 2];	possibilitiesleft = 32;		break;
  148. 						case 11:guess = [0, 1, 0, 2];	possibilitiesleft = 4;		break;
  149. 						case 12:guess = [0, 1, 1, 2];	possibilitiesleft = 20;		break;
  150. 						}
  151. 						break;
  152. 					case 7:
  153. 						switch (index) {
  154. 						case 0: guess = [4, 4, 4, 5];	possibilitiesleft = 81;		break;
  155. 						case 1: guess = [0, 4, 4, 5];	possibilitiesleft = 444;	break;
  156. 						case 2: guess = [1, 2, 4, 2];	possibilitiesleft = 582;	break;
  157. 						case 3: guess = [1, 2, 4, 2];	possibilitiesleft = 180;	break;
  158. 						case 4: guess = [0, 0, 0, 1];	possibilitiesleft = 9;		break;
  159. 						case 5: guess = [4, 4, 5, 5];	possibilitiesleft = 256;	break;
  160. 						case 6: guess = [0, 1, 4, 5];	possibilitiesleft = 432;	break;
  161. 						case 7: guess = [0, 0, 1, 1];	possibilitiesleft = 168;	break;
  162. 						case 8: guess = [0, 0, 1, 2];	possibilitiesleft = 8;		break;
  163. 						case 9: guess = [0, 2, 4, 5];	possibilitiesleft = 150;	break;
  164. 						case 10:guess = [0, 0, 1, 1];	possibilitiesleft = 60;		break;
  165. 						case 11:guess = [0, 0, 1, 1];	possibilitiesleft = 6;		break;
  166. 						case 12:guess = [0, 0, 1, 1];	possibilitiesleft = 24;		break;
  167. 						}
  168. 						break;
  169. 					case 8:
  170. 						switch (index) {
  171. 						case 0: guess = [4, 4, 5, 6];	possibilitiesleft = 256;	break;
  172. 						case 1: guess = [4, 4, 5, 5];	possibilitiesleft = 976;	break;
  173. 						case 2: guess = [1, 2, 0, 4];	possibilitiesleft = 936;	break;
  174. 						case 3: guess = [1, 2, 4, 2];	possibilitiesleft = 224;	break;
  175. 						case 4: guess = [0, 0, 0, 1];	possibilitiesleft = 9;		break;
  176. 						case 5: guess = [4, 4, 5, 5];	possibilitiesleft = 500;	break;
  177. 						case 6: guess = [0, 1, 4, 5];	possibilitiesleft = 660;	break;
  178. 						case 7: guess = [0, 0, 1, 1];	possibilitiesleft = 204;	break;
  179. 						case 8: guess = [0, 0, 1, 2];	possibilitiesleft = 8;		break;
  180. 						case 9: guess = [0, 2, 4, 5];	possibilitiesleft = 216;	break;
  181. 						case 10:guess = [0, 0, 1, 1];	possibilitiesleft = 72;		break;
  182. 						case 11:guess = [0, 0, 1, 1];	possibilitiesleft = 6;		break;
  183. 						case 12:guess = [0, 0, 1, 1];	possibilitiesleft = 28;		break;
  184. 						}
  185. 						break;
  186. 					}
  187. 				} else {
  188. 					switch(numberofcolors) {
  189. 					case 4:
  190. 						switch (index) {
  191. 						case 0: guess = [3, 3, 3, 3];	possibilitiesleft = 1;		break;
  192. 						case 1: guess = [0, 2, 2, 3];	possibilitiesleft = 12;		break;
  193. 						case 2: guess = [3, 1, 0, 3];	possibilitiesleft = 28;		break;
  194. 						case 3: guess = [3, 1, 2, 0];	possibilitiesleft = 12;		break;
  195. 						case 4: guess = [2, 1, 0, 1];	possibilitiesleft = 1;		break;
  196. 						case 5: guess = [0, 2, 3, 2];	possibilitiesleft = 14;		break;
  197. 						case 6: guess = [1, 1, 3, 3];	possibilitiesleft = 34;		break;
  198. 						case 7: guess = [1, 0, 2, 0];	possibilitiesleft = 30;		break;
  199. 						case 8: guess = [1, 1, 2, 0];	possibilitiesleft = 3;		break;
  200. 						case 9: guess = [3, 1, 1, 3];	possibilitiesleft = 24;		break;
  201. 						case 10:guess = [1, 1, 3, 2];	possibilitiesleft = 17;		break;
  202. 						case 11:guess = [2, 0, 1, 1];	possibilitiesleft = 4;		break;
  203. 						case 12:guess = [0, 0, 1, 3];	possibilitiesleft = 11;		break;
  204. 						}
  205. 						break;
  206. 					case 5:
  207. 						switch (index) {
  208. 						case 0:	break;
  209. 						case 1: guess = [0, 0, 0, 4];	possibilitiesleft = 12;		break;
  210. 						case 2: guess = [0, 0, 1, 2];	possibilitiesleft = 90;		break;
  211. 						case 3: guess = [2, 0, 2, 3];	possibilitiesleft = 81;		break;
  212. 						case 4: guess = [0, 1, 1, 2];	possibilitiesleft = 9;		break;
  213. 						case 5: guess = [0, 0, 1, 3];	possibilitiesleft = 20;		break;
  214. 						case 6: guess = [2, 0, 1, 1];	possibilitiesleft = 93;		break;
  215. 						case 7: guess = [2, 1, 0, 1];	possibilitiesleft = 87;		break;
  216. 						case 8: guess = [1, 1, 2, 3];	possibilitiesleft = 8;		break;
  217. 						case 9: guess = [1, 0, 1, 2];	possibilitiesleft = 45;		break;
  218. 						case 10:guess = [0, 1, 1, 4];	possibilitiesleft = 33;		break;
  219. 						case 11:guess = [1, 1, 2, 2];	possibilitiesleft = 6;		break;
  220. 						case 12:guess = [2, 2, 0, 1];	possibilitiesleft = 15;		break;
  221. 						}
  222. 						break;
  223. 					case 6:
  224. 						switch (index) {
  225. 						case 0: guess = [3, 0, 3, 4];	possibilitiesleft = 192;	break;
  226. 						case 1: guess = [3, 3, 1, 4];	possibilitiesleft = 208;	break;
  227. 						case 2: guess = [3, 0, 1, 3];	possibilitiesleft = 84;		break;
  228. 						case 3: guess = [2, 0, 1, 2];	possibilitiesleft = 15;		break;
  229. 						case 4: guess = [2, 2, 1, 1];	possibilitiesleft = 1;		break;
  230. 						case 5: guess = [3, 3, 2, 4];	possibilitiesleft = 208;	break;
  231. 						case 6: guess = [3, 0, 2, 2];	possibilitiesleft = 183;	break;
  232. 						case 7: guess = [1, 2, 1, 3];	possibilitiesleft = 34;		break;
  233. 						case 8:	break;
  234. 						case 9: guess = [2, 1, 0, 3];	possibilitiesleft = 101;	break;
  235. 						case 10:guess = [1, 2, 2, 3];	possibilitiesleft = 30;		break;
  236. 						case 11:guess = [0, 1, 1, 2];	possibilitiesleft = 4;		break;
  237. 						case 12:guess = [1, 0, 1, 2];	possibilitiesleft = 19;		break;
  238. 						}
  239. 						break;
  240. 					case 7:
  241. 						switch (index) {
  242. 						case 0: guess = [4, 4, 4, 5];	possibilitiesleft = 81;		break;
  243. 						case 1: guess = [4, 5, 2, 5];	possibilitiesleft = 396;	break;
  244. 						case 2: guess = [2, 4, 1, 1];	possibilitiesleft = 466;	break;
  245. 						case 3: guess = [4, 1, 1, 2];	possibilitiesleft = 131;	break;
  246. 						case 4: guess = [2, 3, 0, 1];	possibilitiesleft = 6;		break;
  247. 						case 5: guess = [1, 4, 3, 5];	possibilitiesleft = 240;	break;
  248. 						case 6: guess = [1, 0, 4, 5];	possibilitiesleft = 375;	break;
  249. 						case 7: guess = [2, 4, 1, 2];	possibilitiesleft = 135;	break;
  250. 						case 8: guess = [0, 0, 0, 2];	possibilitiesleft = 6;		break;
  251. 						case 9: guess = [2, 0, 4, 5];	possibilitiesleft = 140;	break;
  252. 						case 10:guess = [1, 2, 4, 2];	possibilitiesleft = 53;		break;
  253. 						case 11:guess = [0, 0, 0, 3];	possibilitiesleft = 5;		break;
  254. 						case 12:guess = [2, 0, 1, 4];	possibilitiesleft = 23;		break;
  255. 						}
  256. 						break;
  257. 					case 8:
  258. 						switch (index) {
  259. 						case 0: guess = [5, 0, 5, 6];	possibilitiesleft = 192;	break;
  260. 						case 1: guess = [5, 5, 6, 6];	possibilitiesleft = 807;	break;
  261. 						case 2: guess = [2, 0, 4, 5];	possibilitiesleft = 837;	break;
  262. 						case 3: guess = [2, 3, 5, 3];	possibilitiesleft = 213;	break;
  263. 						case 4: guess = [0, 1, 1, 2];	possibilitiesleft = 9;		break;
  264. 						case 5: guess = [1, 0, 5, 5];	possibilitiesleft = 425;	break;
  265. 						case 6: guess = [5, 2, 3, 6];	possibilitiesleft = 597;	break;
  266. 						case 7: guess = [1, 1, 2, 2];	possibilitiesleft = 195;	break;
  267. 						case 8: guess = [1, 1, 2, 3];	possibilitiesleft = 8;		break;
  268. 						case 9: guess = [2, 5, 3, 6];	possibilitiesleft = 198;	break;
  269. 						case 10:guess = [0, 1, 3, 5];	possibilitiesleft = 69;		break;
  270. 						case 11:guess = [1, 1, 2, 2];	possibilitiesleft = 6;		break;
  271. 						case 12:guess = [2, 1, 3, 3];	possibilitiesleft = 27;		break;
  272. 						}
  273. 						break;
  274. 					}				
  275. 	
  276. 					if (guess != null) {
  277. 						guess[0] += legacyHelp;
  278. 						guess[1] += legacyHelp;
  279. 						guess[2] += legacyHelp;
  280. 						guess[3] += legacyHelp;
  281. 	
  282. 						guess[0] %= numberofcolors;
  283. 						guess[1] %= numberofcolors;
  284. 						guess[2] %= numberofcolors;
  285. 						guess[3] %= numberofcolors;
  286. 					}
  287. 				}
  288. 			} else {
  289. 				makePossibilities();
  290. 	
  291. 				for (var i = 0; i < previousGuesses.length; i++) {
  292. 					cleanse([previousGuesses[i][4], previousGuesses[i][5]], [previousGuesses[i][0], previousGuesses[i][1], previousGuesses[i][2], previousGuesses[i][3]], true);
  293. 				}
  294. 	
  295. 				allowpossibilitiesdisplay = true;
  296. 				possibilitiesleft = possibilities.length;
  297.  
  298. 				if (possibilities.length == 1) {
  299. 					guess = guesses[possibilities[0]];
  300. 				} else {
  301. 					for (var i = 0; i < 3; i++) {
  302. 						for (var j = 0; j < 5 - i; j++) {
  303. 							responses.push([i, j]);
  304. 						}
  305. 					}
  306. 					responses.push([3, 0]);
  307.  
  308. 					guess = findBestGuess();
  309. 				}
  310. 			}
  311.  
  312. 			element1.selectedIndex = guess[0];
  313. 			element2.selectedIndex = guess[1];
  314. 			element3.selectedIndex = guess[2];
  315. 			element4.selectedIndex = guess[3];
  316.  
  317. 			if (possibilitiesleft) {
  318. 				var temp = document.evaluate("//center/table/tbody/tr/td/form", document, null, XPathResult.ORDERED_NODE_SNAPSHOT_TYPE, null);
  319. 	
  320. 				if ((temp != null) && (temp.snapshotLength > 0)) {
  321. 					temp = temp.snapshotItem(0);
  322. 	
  323. 					var helper = document.createElement("div");
  324. 					var helperText = "<font size='+1' color='#A10000'><b>Possibilities Remaining</b></font>: " + possibilitiesleft + "<br />\n<div id='rvExpandSynchroDisplay'></div><div id='rvSynchroLinks'>";
  325. 	
  326. 					if (allowpossibilitiesdisplay)
  327. 						helperText += "<a href='javascript:;' id='rvExpandPossibilities' style='font-size: 12px; color: #a10000;' onfocus='this.blur();'><b>Expand Possibilities</b></a>";
  328. 	
  329. 					helperText += "</div>";
  330. 	
  331. 					helper.setAttribute("id", "rvMiniSynchroDisplay");
  332. 					helper.innerHTML = helperText;
  333. 	
  334. 					temp.parentNode.insertBefore(helper, temp.nextSibling);
  335. 	
  336. 					if (allowpossibilitiesdisplay)
  337. 						document.getElementById("rvExpandPossibilities").addEventListener("click", function() { ExpandPossibilities(0); }, false);
  338. 				} else {
  339. 					alert("Error:\n\nFailed to find spot to put helper");
  340. 				}
  341. 			}
  342. 		}
  343. 	} catch (e) { alert("Exception!\n\nError name: " + e.name + "\nError message: " + e.message); }
  344. }
  345.  
  346. Array.prototype.remove = function(from, to) {
  347.   var rest = this.slice((to || from) + 1 || this.length);
  348.   this.length = from < 0 ? this.length + from : from;
  349.   return this.push.apply(this, rest);
  350. };
  351.  
  352. function ArrayRemove(array, from, to) {
  353. 	var rest = array.slice((to || from) + 1 || array.length);
  354. 	array.length = from < 0 ? array.length + from : from;
  355. 	array.push.apply(array, rest);
  356.  
  357. 	return array;
  358. }
  359.  
  360. function compareArray(arr1, arr2, maxColumn) {
  361. 	if ((maxColumn == null) || (maxColumn == undefined)) maxColumn = arr1.length;
  362.  
  363. 	for (var i = 0; i < maxColumn; i++) {
  364. 		if (arr1[i] != arr2[i]) return false;
  365. 	}
  366.  
  367. 	return true;
  368. }
  369.  
  370. function getLegacyHelp() {
  371. 	var snap = document.evaluate("//form/center/font/b", document, null, XPathResult.ORDERED_NODE_SNAPSHOT_TYPE, null);
  372.  
  373. 	if ((snap == null) && (snap.snapshotLength == 0))
  374. 		return null;
  375.  
  376. 	for (var i = 0; temp = snap.snapshotItem(i); i++) {
  377. 		if (match = temp.textContent.match("Legacy Hint\\: You have a strong feeling that the first Chakra isn't (.*)\\.\\.")) {
  378. 			return reverseElements[match[1]];
  379. 		}
  380. 	}
  381.  
  382. 	return null;
  383. }
  384.  
  385. function getPreviousGuesses() {
  386. 	var snap = document.evaluate("//center/table/tbody/tr/td/center/table/tbody/tr/td/table/tbody/tr", document, null, XPathResult.ORDERED_NODE_SNAPSHOT_TYPE, null);
  387.  
  388. 	if ((snap == null) && (snap.snapshotLength == 0))
  389. 		return;
  390.  
  391. 	for (var i = 0; temp = snap.snapshotItem(i); i++) {
  392. 		temp = temp.childNodes;
  393. 		previousGuesses[i] = [];
  394.  
  395. 		for (var j = 0; j < 4; j++) {
  396. 			previousGuesses[i][j] = reverseElements[temp[j].textContent];
  397. 		}
  398.  
  399. 		if (match = temp[4].textContent.match("(\\d+) / (\\d+)")) {
  400. 			previousGuesses[i][4] = (parseInt(match[1]) || 0);
  401. 			previousGuesses[i][5] = (parseInt(match[2]) || 0);
  402. 		}
  403. 	}
  404. }
  405.  
  406. function makePossibilities() {
  407. 	for (var i = 0; i < numberofcolors; i++) {
  408. 		for (var j = 0; j < numberofcolors; j++) {
  409. 			for (var k = 0; k < numberofcolors; k++) {
  410. 				for (var l = 0; l < numberofcolors; l++) {
  411.  
  412. 					if (i != legacyHelp)
  413. 						possibilities.push(guesses.length);
  414. 					guesses.push([i, j, k, l]);
  415. 				}
  416. 			}
  417. 		}
  418. 	}
  419. }
  420.  
  421. function guessResult(currentguess, solution) {
  422. 	var inplace = 0;
  423. 	var exist = 0;
  424. 	var tempcurrentguess = currentguess.slice(0);
  425. 	var tempsolution = solution.slice(0);
  426.  
  427. 	/*for (var i = 0; i < 4; i++) {
  428. 		if (tempcurrentguess[i] == tempsolution[i]) {
  429. 			inplace++;
  430. 			tempcurrentguess[i] = "?";
  431. 			tempsolution[i] = "!";
  432. 			continue;
  433. 		}
  434.  
  435. 		for (var j = 0; j < 4; j++) {
  436. 			if (tempcurrentguess[i] == tempsolution[j]) {
  437. 				exist++;
  438. 				tempcurrentguess[i] = "?";
  439. 				tempsolution[j] = "!";
  440. 				break;
  441. 			}
  442. 		}
  443. 	}*/
  444.  
  445. 	for (var i = 0; i < 4; i++) {
  446. 		if (tempcurrentguess[i] == tempsolution[i]) {
  447. 			inplace++;
  448. 			tempcurrentguess[i] = "?";
  449. 			tempsolution[i] = "!";
  450. 		}
  451. 	}
  452.  
  453. 	for (var i = 0; i < 4; i++) {
  454. 		for (var j = 0; j < 4; j++) {
  455. 			if (tempcurrentguess[i] == tempsolution[j]) {
  456. 				exist++;
  457. 				tempcurrentguess[i] = "?";
  458. 				tempsolution[j] = "!";
  459. 				break;
  460. 			}
  461. 		}
  462. 	}
  463.  
  464. 	return [inplace, exist];
  465. }
  466.  
  467. function cleanse(comparison, theguess, apply) {
  468. 	var count = 0;
  469.  
  470. 	for (var i = possibilities.length - 1; i >= 0; i--) {
  471. 		var lessee = guessResult(theguess, guesses[possibilities[i]]);
  472.  
  473. 		if ((lessee[0] != comparison[0]) || (lessee[1] != comparison[1])) {
  474. 			count++;
  475. 			if (apply)
  476. 				ArrayRemove(possibilities, i);
  477. 		}
  478. 	}
  479.  
  480. 	return count;
  481. }
  482.  
  483. function guessScore(guess) {
  484. 	var thisguessscore = 99999;
  485.  
  486. 	for (var j = 0; j < responses.length; j++) {
  487. 		thisguessscore = Math.min(thisguessscore, cleanse(responses[j], guess, false));
  488. 	}
  489.  
  490. 	return thisguessscore;
  491. }
  492.  
  493. function findBestGuess() {
  494. 	var bestguessscore = 0;
  495. 	var possible = false;
  496. 	var thisguessscore;
  497. 	var bestguess;
  498.  
  499. 	for (var i = 0; i < guesses.length; i++) {
  500. 		thisguessscore = guessScore(guesses[i]);
  501.  
  502. 		if (thisguessscore > bestguessscore) {
  503. 			bestguessscore = thisguessscore;
  504. 			bestguess = guesses[i];
  505. 			possible = (possibilities.indexOf(i) != -1);
  506. 		} else if ((thisguessscore == bestguessscore) && (!possible) && (possibilities.indexOf(i) != -1)) {
  507. 			bestguess = guesses[i];
  508. 			possible = true;
  509. 		}
  510. 	}
  511.  
  512. 	return bestguess;
  513. }
  514.  
  515. function ExpandPossibilities(pagescroll) {
  516. 	try {
  517. 		var helperText = "";
  518.  
  519. 		possibilitydisplaypage += pagescroll;
  520.  
  521. 		helperText += "<table border='0' cellspacing='0' cellpadding='0'>";
  522.  
  523. 		var temp;
  524. 		var i;
  525. 		var j;
  526. 		for (i = 0; i < 10; i++) {
  527. 			j = i + possibilitydisplaypage*10;
  528. 			if (j >= possibilitiesleft)
  529. 				break;
  530.  
  531. 			temp = guesses[possibilities[j]];
  532. 			helperText += ("<tr><td><b>Possibility #" + j + "</b>:&nbsp;</td><td>" + elementDisplay[temp[0]] + ",&nbsp;</td><td>" + elementDisplay[temp[1]] + ",&nbsp;</td><td>" + elementDisplay[temp[2]] + ",&nbsp;</td><td>" + elementDisplay[temp[3]] + "</td></tr>\n");
  533. 		}
  534.  
  535. 		helperText += "</table>";
  536.  
  537. 		document.getElementById("rvExpandSynchroDisplay").innerHTML = helperText;
  538.  
  539. 		if (pagescroll == 0) {
  540. 			helperText = "<a href='javascript:;' id='rvNextSet' style='display: inline; font-size: 12px; color: #a10000;' onfocus='this.blur();'><b>Next 10</b></a>";
  541. 			helperText += " <a href='javascript:;' id='rvPreviousSet' style='display: inline; font-size: 12px; color: #a10000;' onfocus='this.blur();'><b>Previous 10</b></a>";
  542.  
  543. 			document.getElementById("rvSynchroLinks").innerHTML = helperText;
  544.  
  545. 			document.getElementById("rvNextSet").addEventListener("click", function() { ExpandPossibilities(+1); }, false);
  546. 			document.getElementById("rvPreviousSet").addEventListener("click", function() { ExpandPossibilities(-1); }, false);
  547. 		}
  548.  
  549. 		if ((i == 10) && (j < possibilitiesleft-1))
  550. 			document.getElementById("rvNextSet").style.display = 'block';
  551. 		else
  552. 			document.getElementById("rvNextSet").style.display = 'none';
  553.  
  554. 		if (possibilitydisplaypage > 0)
  555. 			document.getElementById("rvPreviousSet").style.display = 'block';
  556. 		else
  557. 			document.getElementById("rvPreviousSet").style.display = 'none';
  558. 	} catch (e) { alert("Exception!\n\nError name: " + e.name + "\nError message: " + e.message); }
  559. }
  560.  
  561. var gvar = new Object();
  562.  
  563. function GM_ApiBrowserCheck() {
  564. 	if (typeof(unsafeWindow) == 'undefined') { unsafeWindow=window; }
  565. 	if (typeof(GM_log) == 'undefined') { GM_log = function(msg) { try { unsafeWindow.console.log('GM_log: ' + msg); } catch(e) {} }; }
  566. 	GM_clog = function(msg) { if (arguments.callee.counter) { arguments.callee.counter++; } else { arguments.callee.counter=1; } GM_log('('+arguments.callee.counter+') '+msg); }
  567. 	GM_addGlobalStyle = function(css) {
  568. 		var sel = document.createElement('style');
  569. 		sel.setAttribute('type','text/css');
  570. 		sel.appendChild(document.createTextNode(css));
  571. 		var hel = document.documentElement.firstChild;
  572. 		while (hel && hel.nodeName != 'HEAD') { hel=hel.nextSibling; }
  573. 		if (hel && hel.nodeName == 'HEAD') { hel.appendChild(sel); } else { document.body.insertBefore(sel,document.body.firstChild); }
  574. 		return sel;
  575. 	}
  576. 	
  577. 	var needApiUpgrade=false;
  578.  
  579. 	if(window.navigator.appName.match(/^opera/i) && typeof(window.opera) != 'undefined') {
  580. 		needApiUpgrade=true; gvar.isOpera=true; GM_log=window.opera.postError; GM_log('Opera detected...');
  581. 	}
  582.  
  583. 	if(typeof(GM_setValue) != 'undefined') {
  584. 		try {
  585. 			var gsv=GM_setValue.toString();
  586. 			if (gsv.indexOf('staticArgs') > 0) { gvar.isGreaseMonkey = true; GM_log('GreaseMonkey Api detected...'); }
  587. 			else if (gsv.match(/not\s+supported/)) { needApiUpgrade = true; gvar.isBuggedChrome = true; GM_log('Bugged Chrome GM Api detected...'); }
  588. 		} catch(e) {
  589. 			gvar.isGreaseMonkey = (typeof(GM_setValue) == 'function');
  590. 			if (gvar.isGreaseMonkey)
  591. 				GM_log('GreaseMonkey Api is assumed because of exception...');
  592. 			else
  593. 				needApiUpgrade = true;
  594. 		}
  595. 	} else {
  596. 		needApiUpgrade=true; GM_log('No GM Api detected...');
  597. 	}
  598.  
  599. 	if(needApiUpgrade) {
  600. 		GM_log('Try to recreate needed GM Api...');
  601.  		var ws = null;
  602. 		try { ws=typeof(unsafeWindow.localStorage); unsafeWindow.localStorage.length; } catch(e) { ws=null; } // Catch Security error
  603.  
  604. 		if (ws=='object') {
  605. 			GM_log('Using localStorage for GM Api.');
  606. 			GM_getValue=function(name,defValue) { var value=unsafeWindow.localStorage.getItem(GMSTORAGE_PATH+name); if(value==null) { return defValue; } else { switch(value.substr(0,2)) { case 'S]': return value.substr(2); case 'N]': return parseInt(value.substr(2)); case 'B]': return value.substr(2)=='true'; } } return value; }
  607. 			GM_setValue=function(name,value) { switch (typeof(value)) { case 'string': unsafeWindow.localStorage.setItem(GMSTORAGE_PATH+name,'S]'+value); break; case 'number': if(value.toString().indexOf('.')<0) { unsafeWindow.localStorage.setItem(GMSTORAGE_PATH+name,'N]'+value); } break; case 'boolean': unsafeWindow.localStorage.setItem(GMSTORAGE_PATH+name,'B]'+value); break; } }
  608. 			GM_deleteValue=function(name) { unsafeWindow.localStorage.removeItem(GMSTORAGE_PATH+name); }
  609. 		} else if(!gvar.isOpera || typeof(GM_setValue)=='undefined') {
  610. 			GM_log('Using temporarilyStorage for GM Api.'); gvar.temporarilyStorage=new Array();
  611. 			GM_getValue=function(name,defValue) { if(typeof(gvar.temporarilyStorage[GMSTORAGE_PATH+name])=='undefined') { return defValue; } else { return gvar.temporarilyStorage[GMSTORAGE_PATH+name]; } }
  612. 			GM_setValue=function(name,value) { switch (typeof(value)) { case "string": case "boolean": case "number": gvar.temporarilyStorage[GMSTORAGE_PATH+name]=value; } }
  613. 			GM_deleteValue=function(name) { delete gvar.temporarilyStorage[GMSTORAGE_PATH+name]; };
  614. 		}
  615. 		
  616. 		if(typeof(GM_addStyle)=='undefined') { GM_addStyle=function(css) { var heads = document.getElementsByTagName("head"); if (heads.length > 0) { var node = document.createElement("style"); node.type = "text/css"; node.appendChild(document.createTextNode(css)); heads[0].appendChild(node); } } }
  617. 		if(typeof(GM_openInTab)=='undefined') { GM_openInTab=function(url) { unsafeWindow.open(url,""); } }
  618. 		if(typeof(GM_registerMenuCommand)=='undefined') { GM_registerMenuCommand=function(name,cmd) { GM_log("Notice: GM_registerMenuCommand is not supported."); } } // Dummy
  619. 		if(!gvar.isOpera || typeof(GM_xmlhttpRequest)=='undefined') {
  620. 			GM_log('Using XMLHttpRequest for GM Api.');
  621. 			GM_xmlhttpRequest=function(obj) {
  622. 				var request=new XMLHttpRequest();
  623. 				request.onreadystatechange=function() { if(obj.onreadystatechange) { obj.onreadystatechange(request); }; if(request.readyState==4 && obj.onload) { obj.onload(request); } }
  624. 				request.onerror=function() { if(obj.onerror) { obj.onerror(request); } }
  625. 				try { request.open(obj.method,obj.url,true); } catch(e) { if(obj.onerror) { obj.onerror( {readyState:4,responseHeaders:'',responseText:'',responseXML:'',status:403,statusText:'Forbidden'} ); }; return; }
  626. 				if(obj.headers) { for(name in obj.headers) { request.setRequestHeader(name,obj.headers[name]); } }
  627. 				request.send(obj.data); return request;
  628. 			}
  629. 		}
  630. 	}
  631. }
  632.  
  633. function waitForReady(callback) {
  634. 	var docState;
  635. 	
  636. 	try { docState = unsafeWindow.document.readyState; } catch(e) { docState = null; }
  637. 	if(docState) {
  638. 		if ((docState != 'complete') && (docState != 'interactive')) {
  639. 			window.setTimeout(waitForReady, 150, callback);
  640. 			return;
  641. 		}
  642. 	}
  643. 	
  644. 	callback();
  645. }
  646.  
  647. GM_ApiBrowserCheck();
  648. waitForReady(load);