trangleCalc.js 4.9 KB

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