trangleCalc.js 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243
  1. const crypto = require('crypto');
  2. const Logs = require('../libs/logs');
  3. const IOR_KEYS_MAP = require('./iorKeys');
  4. const { getSetting } = require('./settings');
  5. const { eventSolutions } = require('./eventSolutions');
  6. const HG_REBATE_RATIO_LOWER = 0.75;
  7. /**
  8. * 筛选最优赔率
  9. */
  10. const oddRebateValue = (odds, platform, key) => {
  11. const setting = getSetting();
  12. let rebateRatio = setting[`${platform}RebateRatio`] ?? 0;
  13. let rebateType = setting[`${platform}RebateType`] ?? 0;
  14. if (platform == 'hg' && key.startsWith('ior_m')) {
  15. rebateRatio -= HG_REBATE_RATIO_LOWER;
  16. }
  17. if (rebateType == 0) {
  18. return odds * (1 + rebateRatio / 100);
  19. }
  20. return odds + rebateRatio / 100;
  21. }
  22. const cartesianOdds = (selection) => {
  23. const [a, b, c] = selection;
  24. return a.flatMap(itemA => b.flatMap(itemB => c.map(itemC => [itemA, itemB, itemC])));
  25. }
  26. const getOptimalSelections = (odds, rules) => {
  27. const results = [];
  28. rules.forEach((rule, ruleIndex) => {
  29. let validOptions = [];
  30. for (let i = 0; i < 3; i++) {
  31. const innerIndex = i;
  32. const selection = [];
  33. let isValid = true;
  34. for (let j = 0; j < 3; j++) {
  35. const key = rule[j];
  36. let item = odds[key];
  37. if (key == '-') {
  38. item = { no: { v: 1 } };
  39. }
  40. if (!item) {
  41. isValid = false;
  42. break;
  43. }
  44. if (j === innerIndex) {
  45. if (!('ps' in item)) {
  46. isValid = false;
  47. break;
  48. }
  49. selection.push([{
  50. k: key,
  51. p: 'ps',
  52. v: item.ps.v,
  53. r: item.ps.r,
  54. s: item.ps.s,
  55. o: item
  56. }]);
  57. }
  58. else {
  59. const { ps, ...itemRest } = item;
  60. // const candidates = ['ob', 'hg', 'no'].filter((k) => k in item);
  61. const candidates = Object.keys(itemRest);
  62. if (candidates.length === 0) {
  63. isValid = false;
  64. break;
  65. }
  66. // Logs.out('candidates', candidates)
  67. // const best = candidates.reduce((a, b) => {
  68. // const aValue = oddRebateValue(item[a].v-1, a, key);
  69. // const bValue = oddRebateValue(item[b].v-1, b, key);
  70. // const seletcted = aValue > bValue ? a : b;
  71. // return seletcted;
  72. // });
  73. // Logs.out('best', item, best)
  74. // selection.push({
  75. // k: key,
  76. // p: best,
  77. // v: item[best].v,
  78. // r: item[best].r,
  79. // s: item[best].s,
  80. // o: item
  81. // });
  82. selection.push(candidates.map(k => ({
  83. k: key,
  84. p: k,
  85. v: item[k].v,
  86. r: item[k].r,
  87. s: item[k].s,
  88. o: item
  89. })));
  90. }
  91. }
  92. if (isValid) {
  93. const cartesian = cartesianOdds(selection);
  94. cartesian.forEach(item => {
  95. validOptions.push(item);
  96. });
  97. }
  98. }
  99. validOptions.forEach(iors => {
  100. results.push({ rule, iors, ruleIndex });
  101. });
  102. // if (validOptions.length > 0) {
  103. // const iors = validOptions.reduce((a, b) => {
  104. // const sumA = a.reduce((sum, x) => sum + x.v, 0);
  105. // const sumB = b.reduce((sum, x) => sum + x.v, 0);
  106. // return sumA > sumB ? a : b;
  107. // });
  108. // results.push({ rule, iors, ruleIndex });
  109. // }
  110. });
  111. // if (results.length) {
  112. // Logs.outDev('results', results);
  113. // }
  114. // return [];
  115. return results;
  116. }
  117. /**
  118. * 精确浮点数字
  119. * @param {number} number
  120. * @param {number} x
  121. * @returns {number}
  122. */
  123. const fixFloat = (number, x=2) => {
  124. return parseFloat(number.toFixed(x));
  125. }
  126. /**
  127. * 盘口排序
  128. */
  129. const priority = { ps: 1, ob: 2, hg: 3 };
  130. const sortCpr = (cpr) => {
  131. const temp = [...cpr];
  132. temp.sort((a, b) => priority[a.p] - priority[b.p]);
  133. return temp;
  134. }
  135. /**
  136. * 获取平台类型
  137. */
  138. const getPlatformKey = (cpr) => {
  139. const platforms = sortCpr(cpr).map(item => item.p);
  140. return [...new Set(platforms)].join('_');
  141. }
  142. /**
  143. * 添加返佣
  144. */
  145. const attachRebate = (ior) => {
  146. const { obRebateRatio, obRebateType, hgRebateRatio, hgRebateType } = getSetting();
  147. const { p, k } = ior;
  148. let rebate = 0, rebateType = 0;
  149. if (p == 'ps') {
  150. rebate = 0;
  151. rebateType = -1;
  152. }
  153. else if (p == 'ob') {
  154. rebate = obRebateRatio;
  155. rebateType = obRebateType;
  156. }
  157. else if (p == 'hg') {
  158. rebate = hgRebateRatio;
  159. rebateType = hgRebateType;
  160. if (k.startsWith('ior_m')) {
  161. rebate -= HG_REBATE_RATIO_LOWER;
  162. }
  163. }
  164. return { ...ior, b: rebate, t: rebateType };
  165. }
  166. const eventsCombination = (passableEvents) => {
  167. // Logs.outDev('passableEvents', passableEvents);
  168. const { innerDefaultAmount, innerRebateRatio } = getSetting();
  169. const solutions = [];
  170. passableEvents.forEach(events => {
  171. const { odds, info } = events;
  172. Object.keys(IOR_KEYS_MAP).forEach(iorGroup => {
  173. const rules = IOR_KEYS_MAP[iorGroup];
  174. const optimalSelections = getOptimalSelections(odds, rules);
  175. optimalSelections.forEach(selection => {
  176. const { rule, iors, ruleIndex } = selection;
  177. const [, , , crossType] = rule;
  178. const oddsSideA = attachRebate(iors[0]);
  179. const oddsSideB = attachRebate(iors[1]);
  180. const oddsSideC = attachRebate(iors[2]);
  181. const innerIndex = iors.findIndex(item => item.p == 'ps');
  182. if (!oddsSideA || !oddsSideB || !oddsSideC) {
  183. return;
  184. }
  185. const cpr = [ oddsSideA, oddsSideB, oddsSideC ];
  186. const betInfo = {
  187. cross_type: crossType,
  188. inner_index: innerIndex,
  189. inner_base: innerDefaultAmount,
  190. inner_rebate: fixFloat(innerRebateRatio / 100, 3),
  191. odds_side_a: fixFloat(oddsSideA.v - 1),
  192. odds_side_b: fixFloat(oddsSideB.v - 1),
  193. odds_side_c: fixFloat(oddsSideC.v - 1),
  194. rebate_side_a: parseFloat((oddsSideA.b / 100).toFixed(4)),
  195. rebate_type_side_a: oddsSideA.t,
  196. rebate_side_b: parseFloat((oddsSideB.b / 100).toFixed(4)),
  197. rebate_type_side_b: oddsSideB.t,
  198. rebate_side_c: parseFloat((oddsSideC.b / 100).toFixed(4)),
  199. rebate_type_side_c: oddsSideC.t,
  200. };
  201. const sol = eventSolutions(betInfo, true);
  202. if (cpr[2].k == '-') {
  203. cpr.pop();
  204. }
  205. if (!isNaN(sol?.win_average)) {
  206. const id = info.id;
  207. // const sortedCpr = sortCpr(cpr);
  208. const keys = cpr.map(item => `${item.k}-${item.p}`).join('##');
  209. // Logs.outDev('keys', `${id}##${keys}`)
  210. const sid = crypto.createHash('sha1').update(`${id}-${keys}`).digest('hex');
  211. const crpGroup = `${id}_${cpr.find(item => item.p == 'ps').k}`;
  212. // Logs.outDev('crpGroup', crpGroup)
  213. const platformKey = getPlatformKey(cpr);
  214. // Logs.outDev('platformKey', platformKey, cpr)
  215. const timestamp = Date.now();
  216. solutions.push({sid, sol, cpr, cross: platformKey, info, group: crpGroup, rule: `${iorGroup}:${ruleIndex}`, timestamp});
  217. }
  218. });
  219. });
  220. });
  221. return solutions.sort((a, b) => {
  222. return b.sol.win_average - a.sol.win_average;
  223. });
  224. }
  225. module.exports = { eventsCombination };