trangleCalc.js 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185
  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. /**
  7. * 筛选最优赔率
  8. */
  9. function getOptimalSelections(odds, rules) {
  10. const results = [];
  11. const { obRebateRatio, hgRebateRatio } = getSetting();
  12. const rebateMap = {
  13. ob: 1 + obRebateRatio / 100,
  14. hg: 1 + hgRebateRatio / 100,
  15. };
  16. rules.forEach((rule, ruleIndex) => {
  17. let validOptions = [];
  18. for (let i = 0; i < 3; i++) {
  19. const innerIndex = i;
  20. const selection = [];
  21. let isValid = true;
  22. for (let j = 0; j < 3; j++) {
  23. const key = rule[j];
  24. let item = odds[key];
  25. if (key == '-') {
  26. item = { no: { v: 1 } };
  27. }
  28. if (!item) {
  29. isValid = false;
  30. break;
  31. }
  32. if (j === innerIndex) {
  33. if (!('ps' in item)) {
  34. isValid = false;
  35. break;
  36. }
  37. selection.push({
  38. k: key,
  39. p: 'ps',
  40. v: item.ps.v,
  41. r: item.ps.r,
  42. o: item
  43. });
  44. }
  45. else {
  46. const candidates = ['ob', 'hg', 'no'].filter((k) => k in item);
  47. if (candidates.length === 0) {
  48. isValid = false;
  49. break;
  50. }
  51. // Logs.out('candidates', candidates)
  52. const best = candidates.reduce((a, b) => {
  53. const aValue = (item[a].v-1)*rebateMap[a];
  54. const bValue = (item[b].v-1)*rebateMap[b];
  55. const seletcted = aValue > bValue ? a : b;
  56. return seletcted;
  57. });
  58. // Logs.out('best', item, best)
  59. selection.push({
  60. k: key,
  61. p: best,
  62. v: item[best].v,
  63. r: item[best].r,
  64. o: item
  65. });
  66. }
  67. }
  68. if (isValid) {
  69. validOptions.push(selection);
  70. }
  71. }
  72. validOptions.forEach(iors => {
  73. results.push({ rule, iors, ruleIndex });
  74. });
  75. // if (validOptions.length > 0) {
  76. // const iors = validOptions.reduce((a, b) => {
  77. // const sumA = a.reduce((sum, x) => sum + x.v, 0);
  78. // const sumB = b.reduce((sum, x) => sum + x.v, 0);
  79. // return sumA > sumB ? a : b;
  80. // });
  81. // results.push({ rule, iors, ruleIndex });
  82. // }
  83. });
  84. return results;
  85. }
  86. /**
  87. * 精确浮点数字
  88. * @param {number} number
  89. * @param {number} x
  90. * @returns {number}
  91. */
  92. const fixFloat = (number, x=2) => {
  93. return parseFloat(number.toFixed(x));
  94. }
  95. /**
  96. * 盘口排序
  97. */
  98. const priority = { ps: 1, ob: 2, hg: 3 };
  99. const sortCpr = (cpr) => {
  100. const temp = [...cpr];
  101. temp.sort((a, b) => priority[a.p] - priority[b.p]);
  102. return temp;
  103. }
  104. /**
  105. * 添加返佣
  106. */
  107. const attachRebate = (ior) => {
  108. const { obRebateRatio, hgRebateRatio } = getSetting();
  109. const { p } = ior;
  110. let rebate = 0;
  111. if (p == 'ps') {
  112. rebate = 0;
  113. }
  114. else if (p == 'ob') {
  115. rebate = obRebateRatio;
  116. }
  117. else if (p == 'hg') {
  118. rebate = hgRebateRatio;
  119. }
  120. return { ...ior, b: rebate };
  121. }
  122. const eventsCombination = (passableEvents) => {
  123. const { minProfitAmount, innerDefaultAmount, innerRebateRatio } = getSetting();
  124. const solutions = [];
  125. passableEvents.forEach(events => {
  126. const { odds, info } = events;
  127. Object.keys(IOR_KEYS_MAP).forEach(iorGroup => {
  128. const rules = IOR_KEYS_MAP[iorGroup];
  129. const optimalSelections = getOptimalSelections(odds, rules);
  130. optimalSelections.forEach(selection => {
  131. const { rule, iors, ruleIndex } = selection;
  132. const [, , , crossType] = rule;
  133. const oddsSideA = attachRebate(iors[0]);
  134. const oddsSideB = attachRebate(iors[1]);
  135. const oddsSideC = attachRebate(iors[2]);
  136. const innerIndex = iors.findIndex(item => item.p == 'ps');
  137. if (!oddsSideA || !oddsSideB || !oddsSideC) {
  138. return;
  139. }
  140. const cpr = [ oddsSideA, oddsSideB, oddsSideC ];
  141. const betInfo = {
  142. cross_type: crossType,
  143. inner_index: innerIndex,
  144. inner_base: innerDefaultAmount,
  145. inner_rebate: fixFloat(innerRebateRatio / 100, 3),
  146. odds_side_a: fixFloat(oddsSideA.v - 1),
  147. odds_side_b: fixFloat(oddsSideB.v - 1),
  148. odds_side_c: fixFloat(oddsSideC.v - 1),
  149. rebate_side_a: parseFloat((oddsSideA.b / 100).toFixed(4)),
  150. rebate_side_b: parseFloat((oddsSideB.b / 100).toFixed(4)),
  151. rebate_side_c: parseFloat((oddsSideC.b / 100).toFixed(4)),
  152. };
  153. const sol = eventSolutions(betInfo, true);
  154. if (cpr[2].k == '-') {
  155. cpr.pop();
  156. }
  157. if (sol?.win_average > minProfitAmount) {
  158. const id = info.id;
  159. const sortedCpr = sortCpr(cpr);
  160. const keys = sortedCpr.map(item => `${item.k}`).join('_');
  161. const sid = crypto.createHash('sha1').update(`${id}_${keys}`).digest('hex');
  162. const crpGroup = `${id}_${sortedCpr[0].k}`;
  163. const timestamp = Date.now();
  164. solutions.push({sid, sol, cpr, info, group: crpGroup, rule: `${iorGroup}:${ruleIndex}`, timestamp});
  165. }
  166. });
  167. });
  168. });
  169. return solutions.sort((a, b) => {
  170. return b.sol.win_average - a.sol.win_average;
  171. });
  172. }
  173. module.exports = { eventsCombination };