trangleCalc.js 5.1 KB

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