blocks|key|1704390|text|是的，这些算法类有一个名字-在machine+learning领域称为。Decision+trees是分类算法的一个例子。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1704391|在这个分类问题中，算法的特征是问题的答案。|1704392|决定下一个问题应该问哪个问题可以通过各种方式来完成-例如，通过尝试最大化下一个问题的预测(或平均)+entropy。|1704393|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Machine_learning|1|http://en.wikipedia.org/wiki/Decision_tree_learning|2|http://en.wikipedia.org/wiki/Information_entropy^0|F|G|0|10|E|1|0|0|1E|7|2|0^^$0|@$1|2|3|4|5|6|7|T|8|@]|9|@$A|U|B|V|1|W]|$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|6|7|10|8|@]|9|@]|C|$]]|$1|F|3|G|5|6|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|H|3|-4|5|6|7|15|8|@]|9|@]|C|$]]]|I|$J|$5|K|L|M|C|$N|O]]|P|$5|K|L|M|C|$N|Q]]|R|$5|K|L|M|C|$N|S]]]]

<p>Yes, there is a name for these class of algorithms - it is called <strong><a href="http://en.wikipedia.org/wiki/Statistical_classification">classification algorithms</a></strong> in the field of <a href="http://en.wikipedia.org/wiki/Machine_learning">machine learning</a>. <a href="http://en.wikipedia.org/wiki/Decision_tree_learning">Decision trees</a> is one example for classification algorithm.</p>

<p>In this classification problem, the features for the algorithm are the answers to the question.</p>

<p>Deciding which question should be asked next can be done in various ways - for example by trying to maximize the predicted (or mean) <a href="http://en.wikipedia.org/wiki/Information_entropy">entropy</a> from the next question.</p>


blocks|key|5697898|text|这个游戏有时被称为20个问题。上面有一些问题，例如：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5697899|5697900|How+do+20+questions+AI+algorithms+work?|unordered-list-item|offset|length|5697901|Designing+a+twenty+questions+algorithm|5697902|the+akinator+is+running+with+a+database?|5697903|5697904|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/887533/how-do-20-questions-ai-algorithms-work|1|https://stackoverflow.com/questions/4915799/designing-a-twenty-questions-algorithm?lq=1|2|https://stackoverflow.com/q/11031143/108915^0|0|0|0|13|0|0|0|12|1|0|0|14|2|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|Z|8|@]|9|@]|A|$]]|$1|C|3|D|5|E|7|10|8|@]|9|@$F|11|G|12|1|13]]|A|$]]|$1|H|3|I|5|E|7|14|8|@]|9|@$F|15|G|16|1|17]]|A|$]]|$1|J|3|K|5|E|7|18|8|@]|9|@$F|19|G|1A|1|1B]]|A|$]]|$1|L|3|-4|5|6|7|1C|8|@]|9|@]|A|$]]|$1|M|3|-4|5|6|7|1D|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]|U|$5|P|Q|R|A|$S|V]]|W|$5|P|Q|R|A|$S|X]]]]

<p>This game is sometimes known as <em>20 Questions</em>. There are some questions on SO on it, e.g.:</p>

<ul>
<li><a href="https://stackoverflow.com/questions/887533/how-do-20-questions-ai-algorithms-work">How do 20 questions AI algorithms work?</a></li>
<li><a href="https://stackoverflow.com/questions/4915799/designing-a-twenty-questions-algorithm?lq=1">Designing a twenty questions algorithm</a></li>
<li><a href="https://stackoverflow.com/q/11031143/108915">the akinator is running with a database?</a></li>
</ul>


blocks|key|2168311|text|算法的主要特点：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2168312|下一个问题的|2168313|Self-educating|unordered-list-item|2168314|Mistakes-indulgence|2168315|Intelligent系统选择|2168316|2168317|启发者博弈算法模型被称为“基于模糊逻辑的专家系统”。|2168318|这不是决策树，因为决策树没有错误-放纵。|2168319|前段时间我在C#上写了一篇文章，你可以通过以下链接找到它：https://github.com/ukushu/AkinatorEngine|offset|length|2168320|您可以在wiki上阅读的其他信息：|2168321|https://en.wikipedia.org/wiki/Expert_system|2168322|https://ru.wikipedia.org/wiki/Экспертная_система|2168323|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ukushu/AkinatorEngine|1|2|https://ru.wikipedia.org/wiki/%25D0%25AD%25D0%25BA%25D1%2581%25D0%25BF%25D0%25B5%25D1%2580%25D1%2582%25D0%25BD%25D0%25B0%25D1%258F_%25D1%2581%25D0%25B8%25D1%2581%25D1%2582%25D0%25B5%25D0%25BC%25D0%25B0^0|0|0|0|0|0|0|0|0|T|14|0|0|0|0|17|1|0|0|1C|2|0^^$0|@$1|2|3|4|5|6|7|1A|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|1B|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|1C|8|@]|9|@]|A|$]]|$1|G|3|H|5|F|7|1D|8|@]|9|@]|A|$]]|$1|I|3|J|5|F|7|1E|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|1F|8|@]|9|@]|A|$]]|$1|L|3|M|5|6|7|1G|8|@]|9|@]|A|$]]|$1|N|3|O|5|6|7|1H|8|@]|9|@]|A|$]]|$1|P|3|Q|5|6|7|1I|8|@]|9|@$R|1J|S|1K|1|1L]]|A|$]]|$1|T|3|U|5|6|7|1M|8|@]|9|@]|A|$]]|$1|V|3|W|5|6|7|1N|8|@]|9|@$R|1O|S|1P|1|1Q]]|A|$]]|$1|X|3|Y|5|6|7|1R|8|@]|9|@$R|1S|S|1T|1|1U]]|A|$]]|$1|Z|3|-4|5|6|7|1V|8|@]|9|@]|A|$]]]|10|$11|$5|12|13|14|A|$15|16]]|17|$5|12|13|14|A|$15|W]]|18|$5|12|13|14|A|$15|19]]]]

<p>Main characteristics of algorithm:</p>
<ul>
<li>Self-educating</li>
<li>Mistakes-indulgence</li>
<li>Intelligent system of next question choose</li>
</ul>
<p>Akinator game algorithm model is called &quot;Expert system based on Fuzzy logic&quot;.</p>
<p>And this is NOT Decision trees, because Decision trees have no mistakes-indulgence.</p>
<p>I had wrote one some time ago on C#, you can find it by link: <a href="https://github.com/ukushu/AkinatorEngine" rel="nofollow noreferrer">https://github.com/ukushu/AkinatorEngine</a></p>
<p>additional info you can read on wiki:</p>
<p><a href="https://en.wikipedia.org/wiki/Expert_system" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Expert_system</a></p>
<p><a href="https://ru.wikipedia.org/wiki/%D0%AD%D0%BA%D1%81%D0%BF%D0%B5%D1%80%D1%82%D0%BD%D0%B0%D1%8F_%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D0%B0" rel="nofollow noreferrer">https://ru.wikipedia.org/wiki/Экспертная_система</a></p>


blocks|key|2168354|text|我不知道Akinator到底使用了什么算法，但我在这里放了一个开源的算法，它可以达到同样的效果：https://github.com/srogatch/ProbQA|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2168355|基本上我们使用N(Questions)乘以N(Answer+Options)乘以N(Targets)的立方体，参见https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CpuEngine.decl.h。|style|CODE|2168356|我们通过应用具有独立性假设的贝叶斯公式来训练立方体，请参阅https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CEEvalQsSubtaskConsider.cpp|2168357|由于代码针对AVX2和多线程进行了高度优化，因此可能很难阅读。这可能更容易阅读CUDA代码，同样的：https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CudaEngineGpu.cu|2168358|该算法的一个应用程序也可以作为website+to+recommend+a+game使用。|2168359|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/srogatch/ProbQA|1|https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CpuEngine.decl.h|2|https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CEEvalQsSubtaskConsider.cpp|3|https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CudaEngineGpu.cu|4|http://probqa.com/^0|1C|Y|0|0|7|C|L|H|14|A|1L|26|1|0|T|2H|2|0|1E|26|3|0|F|R|4|0^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|D|3|E|5|6|7|17|8|@$A|18|B|19|F|G]|$A|1A|B|1B|F|G]|$A|1C|B|1D|F|G]]|9|@$A|1E|B|1F|1|1G]]|C|$]]|$1|H|3|I|5|6|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]|$1|J|3|K|5|6|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]|$1|L|3|M|5|6|7|1P|8|@]|9|@$A|1Q|B|1R|1|1S]]|C|$]]|$1|N|3|-4|5|6|7|1T|8|@]|9|@]|C|$]]]|O|$P|$5|Q|R|S|C|$T|U]]|V|$5|Q|R|S|C|$T|W]]|X|$5|Q|R|S|C|$T|Y]]|Z|$5|Q|R|S|C|$T|10]]|11|$5|Q|R|S|C|$T|12]]]]

<p>I don't know what exactly algorithm Akinator uses, but here I have put open-source an algorithm that achieves the same effect: <a href="https://github.com/srogatch/ProbQA" rel="nofollow noreferrer">https://github.com/srogatch/ProbQA</a></p>

<p>Basically we use a cube of <code>N(Questions)</code> times <code>N(Answer Options)</code> times <code>N(Targets)</code> , see <a href="https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CpuEngine.decl.h" rel="nofollow noreferrer">https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CpuEngine.decl.h</a> .</p>

<p>We train the cube by applying Bayesian formula with independence assumption, see <a href="https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CEEvalQsSubtaskConsider.cpp" rel="nofollow noreferrer">https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CEEvalQsSubtaskConsider.cpp</a></p>

<p>Because the code is highly optimized for AVX2 and multi-threading, it may be hard to read. It may be easier to read the CUDA code for the same: <a href="https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CudaEngineGpu.cu" rel="nofollow noreferrer">https://github.com/srogatch/ProbQA/blob/master/ProbQA/PqaCore/CudaEngineGpu.cu</a></p>

<p>An application of this algorithm is also available as a <a href="http://probqa.com/" rel="nofollow noreferrer">website to recommend a game</a>.</p>


blocks|key|2168270|text|我认为这就像是一个专家系统，具有B-Tree结构。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2168271|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

<p>I think this is like an expert system, with B-Tree structure.</p>


blocks|key|4280916|text|我有一个小项目来建立一个‘找到你的品味’的动态测验，我想与你分享它：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4280917|4280918|​|4280919|const+quizData+=
{
++"title":+"Quiz+about+Foo",+"questions":+[

++++{+"text":+"Tea+or+Coffee+?",+"answers":+[["Coffee","coffee"],+["Tea","tea"]]+},
++++{+"text":+"What+type+of+coffee+do+you+like+?",+"parentanswer":+"coffee",+"answers":+[["Arabic","arabic_coffee"],+["Turkish","turkish-coffee"],+["Espresso","espresso-coffee"],+["Black","black-coffee"]]+},
+++++++{+"text":+"What+type+of+tea+do+you+like+?",+"parentanswer":+"tea",+"answers":+[["Green","green-tea"],+["Red","red-tea"],+["Earl","earl-tea"]]+},
+++++++{+"text":+"Do+you+like+it+stronge+?",+"parentanswer":+"black-coffee",+"answers":+[["Yes","stronge-coffee"],+["No","notstronge-coffee"]]+},
+++++++{+"text":+"Do+you+like+it+light+?",+"parentanswer":+"stronge-coffee",+"answers":+[["Yes","light-coffee"],+["No","notlight-coffee"]]+},
++],
++"products":[
++{+"name":+"Japanese+Green+Tea"+,+"characteristic":+"tea,green-tea"},
++{"name":"Organic+Sencha+Green+Tea"+,+"characteristic":+"tea,green-tea"},
++{"name":"Yogi+Tea"+,+"characteristic":+"tea,green-tea"},

++{"name":"South+African+Rooibos"+,+"characteristic":+"tea,red-tea"},
++{"name":"Lipton"+,+"characteristic":+"tea,red-tea"},+

++{"name":"Alrifai"+,+"characteristic":+"coffee,arabic-coffee"},
++{"name":"Baja"++,+"characteristic":+"coffee,arabic-coffee"},

++{"name":"Tim+Hortons"++,+"characteristic":+"coffee,black-coffee,stronge-coffee"},
++{"name":"Starbucks"++,+"characteristic":+"coffee,black-coffee,light-coffee"},
++{"name":"Espresso+Craft+Blend"++,+"characteristic":+"coffee,++espresso-coffee"},

++{"name":"Baja"++,+"characteristic":+"coffee,++turkish-coffee"},
++
++]
};

Vue.component('question',+{
++template:+`
<div+v-if="question"+class="+m-2"+>
++++<h3+class="text-primary">Find+your+taste</h3>+<br/>+

++<h4>Question+{{+questionNumber+}}+:</h4><br/>
++<h3+class="text-primary">{{+question.text+}}+</h3>+<br/>+
+
++++<div+@change="submitAnswer"+class="+btn-group-toggle"++>
++++
++++<label+class="btn+btn-outline-primary+m-2"+v-for="(mcanswer,index)+in+question.answers"+>
+++++<input+:value="mcanswer"+type="radio"+name="currentQuestion"+:id="'answer'%2Bindex"+v-model="answer"++>+{{mcanswer[0]}}
++++</label>+
++
++++</div>++
++
</div>
`,
++data()+{
++++return+{
++++++answer:+''
++++}
++},
++props:+['question',+'question-number'],
++methods:+{
++++submitAnswer:+function+(e)+{
++++++app.handleAnswer(this);
++++}
++},
});

const+app+=+new+Vue({
++el:+'#quiz',
++data()+{
++++return+{
++++++resultsStage:+false,
++++++title:+'',
++++++questions:+[],
++++++products:[],
++++++currentQuestion:+0,
++++++answers:+[],
++++++correct:+0,
++++++result:+'',
++++++counter:+0
++++}
++},
++created()+{
++++this.title+=+quizData.title;
++++this.questions+=+quizData.questions;
++++this.products+=+quizData.products;
++},
++methods:+{
++++handleAnswer(e)+{+
++++++this.answers[this.currentQuestion]+=+e.answer[0];
+++++
++++++var+i+;
++++++for(i=0;+this.currentQuestion+<+this.questions.length;+i%2B%2B)
++++++{+
++++++++//find+child+question+for+selected+answer
++++++++if(typeof(this.questions[i].parentanswer)!='undefined')
++++++++{
++++++++++if(e.answer[1]+===+this.questions[i].parentanswer)
++++++++++{
++++++++++++this.result+%2B=++e.answer[1]+%2B+',';
++++++++++++this.currentQuestion=i;
++++++++++++this.counter%2B%2B;
++++++++++++break;
++++++++++}
++++++++}
++++++++//no+child+for+this+question+=>+end+of+quiz
++++++++if(i%2B1+==+this.questions.length)
++++++++{
++++++++++this.result+%2B=++e.answer[1];
++++++++++this.handleResults();
++++++++++this.resultsStage+=+true;
++++++++++break;
++++++++}
++++++}+


++++},
++++handleResults()+{
+++++//+window.location.href+=+"http://hadict.com"%2Bthis.result+%2B+"/?sl=ar";
++++++var+i+;
+var+hasResult=false;
+for(i=0;+i+<+this.products.length;+i%2B%2B)
+{+
+++if(+this.products[i].characteristic==this.result)
+++{+++
++++this.result+=+this.products[i].name;+
++++hasResult=true;
++++break;
+++}+
+++
+}
+if(!hasResult)
+{
++this.result="no+result";++
+}
+++
++++}
++}
})|code-block|syntax|javascript|4280920|<script+src="https://cdnjs.cloudflare.com/ajax/libs/vue/2.5.17/vue.js"></script>
<div+id="quiz">
++++<div+v-if="!resultsStage">
++++++<question+:question="questions[currentQuestion]"+:question-number="counter%2B1"></question>
++++</div>

++++<div+v-if="resultsStage">
++++++<div
++++++++style="justify-content:+space-between;display:+flex;flex-direction:+column;align-items:+center;margin:+10px;">
++++++++<h3+class="text-primary">Done</h3>
++++++++<h3+class="text-primary">Your+best+drink+is+:+</h3>++
++++++++<h3+class="text-primary">{{result}}</h3>
++++++</div>
++++</div>
++</div>|4280921|4280922|entityMap^0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|P|8|@]|9|@]|A|$]]|$1|C|3|D|5|6|7|Q|8|@]|9|@]|A|$]]|$1|E|3|F|5|G|7|R|8|@]|9|@]|A|$H|I]]|$1|J|3|K|5|G|7|S|8|@]|9|@]|A|$H|I]]|$1|L|3|D|5|6|7|T|8|@]|9|@]|A|$]]|$1|M|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|N|$]]

<p>i have a small project to build a dynamic quiz for 'find your taste' and i want to share it with you :</p>

<hr>

<p><div class="snippet" data-lang="js" data-hide="false" data-console="true" data-babel="false">
<div class="snippet-code">
<pre class="snippet-code-js lang-js prettyprint-override"><code>const quizData =
{
  "title": "Quiz about Foo", "questions": [

    { "text": "Tea or Coffee ?", "answers": [["Coffee","coffee"], ["Tea","tea"]] },
    { "text": "What type of coffee do you like ?", "parentanswer": "coffee", "answers": [["Arabic","arabic_coffee"], ["Turkish","turkish-coffee"], ["Espresso","espresso-coffee"], ["Black","black-coffee"]] },
       { "text": "What type of tea do you like ?", "parentanswer": "tea", "answers": [["Green","green-tea"], ["Red","red-tea"], ["Earl","earl-tea"]] },
       { "text": "Do you like it stronge ?", "parentanswer": "black-coffee", "answers": [["Yes","stronge-coffee"], ["No","notstronge-coffee"]] },
       { "text": "Do you like it light ?", "parentanswer": "stronge-coffee", "answers": [["Yes","light-coffee"], ["No","notlight-coffee"]] },
  ],
  "products":[
  { "name": "Japanese Green Tea" , "characteristic": "tea,green-tea"},
  {"name":"Organic Sencha Green Tea" , "characteristic": "tea,green-tea"},
  {"name":"Yogi Tea" , "characteristic": "tea,green-tea"},

  {"name":"South African Rooibos" , "characteristic": "tea,red-tea"},
  {"name":"Lipton" , "characteristic": "tea,red-tea"}, 

  {"name":"Alrifai" , "characteristic": "coffee,arabic-coffee"},
  {"name":"Baja"  , "characteristic": "coffee,arabic-coffee"},

  {"name":"Tim Hortons"  , "characteristic": "coffee,black-coffee,stronge-coffee"},
  {"name":"Starbucks"  , "characteristic": "coffee,black-coffee,light-coffee"},
  {"name":"Espresso Craft Blend"  , "characteristic": "coffee,  espresso-coffee"},

  {"name":"Baja"  , "characteristic": "coffee,  turkish-coffee"},
  
  ]
};

Vue.component('question', {
  template: `
&lt;div v-if="question" class=" m-2" &gt;
    &lt;h3 class="text-primary"&gt;Find your taste&lt;/h3&gt; &lt;br/&gt; 

  &lt;h4&gt;Question {{ questionNumber }} :&lt;/h4&gt;&lt;br/&gt;
  &lt;h3 class="text-primary"&gt;{{ question.text }} &lt;/h3&gt; &lt;br/&gt; 
 
    &lt;div @change="submitAnswer" class=" btn-group-toggle"  &gt;
    
    &lt;label class="btn btn-outline-primary m-2" v-for="(mcanswer,index) in question.answers" &gt;
     &lt;input :value="mcanswer" type="radio" name="currentQuestion" :id="'answer'+index" v-model="answer"  &gt; {{mcanswer[0]}}
    &lt;/label&gt; 
  
    &lt;/div&gt;  
  
&lt;/div&gt;
`,
  data() {
    return {
      answer: ''
    }
  },
  props: ['question', 'question-number'],
  methods: {
    submitAnswer: function (e) {
      app.handleAnswer(this);
    }
  },
});

const app = new Vue({
  el: '#quiz',
  data() {
    return {
      resultsStage: false,
      title: '',
      questions: [],
      products:[],
      currentQuestion: 0,
      answers: [],
      correct: 0,
      result: '',
      counter: 0
    }
  },
  created() {
    this.title = quizData.title;
    this.questions = quizData.questions;
    this.products = quizData.products;
  },
  methods: {
    handleAnswer(e) { 
      this.answers[this.currentQuestion] = e.answer[0];
     
      var i ;
      for(i=0; this.currentQuestion &lt; this.questions.length; i++)
      { 
        //find child question for selected answer
        if(typeof(this.questions[i].parentanswer)!='undefined')
        {
          if(e.answer[1] === this.questions[i].parentanswer)
          {
            this.result +=  e.answer[1] + ',';
            this.currentQuestion=i;
            this.counter++;
            break;
          }
        }
        //no child for this question =&gt; end of quiz
        if(i+1 == this.questions.length)
        {
          this.result +=  e.answer[1];
          this.handleResults();
          this.resultsStage = true;
          break;
        }
      } 


    },
    handleResults() {
     // window.location.href = "http://hadict.com"+this.result + "/?sl=ar";
      var i ;
 var hasResult=false;
 for(i=0; i &lt; this.products.length; i++)
 { 
   if( this.products[i].characteristic==this.result)
   {   
    this.result = this.products[i].name; 
    hasResult=true;
    break;
   } 
   
 }
 if(!hasResult)
 {
  this.result="no result";  
 }
   
    }
  }
})</code></pre>
<pre class="snippet-code-html lang-html prettyprint-override"><code>&lt;script src="https://cdnjs.cloudflare.com/ajax/libs/vue/2.5.17/vue.js"&gt;&lt;/script&gt;
&lt;div id="quiz"&gt;
    &lt;div v-if="!resultsStage"&gt;
      &lt;question :question="questions[currentQuestion]" :question-number="counter+1"&gt;&lt;/question&gt;
    &lt;/div&gt;

    &lt;div v-if="resultsStage"&gt;
      &lt;div
        style="justify-content: space-between;display: flex;flex-direction: column;align-items: center;margin: 10px;"&gt;
        &lt;h3 class="text-primary"&gt;Done&lt;/h3&gt;
        &lt;h3 class="text-primary"&gt;Your best drink is : &lt;/h3&gt;  
        &lt;h3 class="text-primary"&gt;{{result}}&lt;/h3&gt;
      &lt;/div&gt;
    &lt;/div&gt;
  &lt;/div&gt;</code></pre>
</div>
</div>
</p>


blocks|key|2168393|text|Akinator使用了更多的二叉树。所以，根节点是第一个问题。这是内在的和内在的。很可能，Akinator也会得到你所在的位置，并链接问题。我已经开发了我自己的Akinator，名为Ankusha。我使用了模式匹配算法。要说Ankusha的工作方式是相当复杂的。您可以从这个github链接获取源代码。Ankusha-The+Mind+Reader+Ankusha在五个问题内完成了猜测。他证实了他和你猜的那部电影。如果你点击“否”，接下来的五个问题会被问到。这个迭代将继续到21个问题。这是一个Python3.7程序，需要强制安装PIL和pygame模块。请一定要试一试。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2168394|注意:在继续安装应用程序之前，请确保已阅读文件README.md。所有许可证都是在GNU+GPLv3+(GNU通用公共许可证版本3.0)下完成的。|style|BOLD|2168395|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/AnuragSimha/Ankusha-TheMindReader^0|47|N|0|0|0|21|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@$A|Q|B|R|1|S]]|C|$]]|$1|D|3|E|5|6|7|T|8|@$A|U|B|V|F|G]]|9|@]|C|$]]|$1|H|3|-4|5|6|7|W|8|@]|9|@]|C|$]]]|I|$J|$5|K|L|M|C|$N|O]]]]

<p>Akinator uses more of binary trees. So, the root node is the first question. This goes on inner and inner. Probably, Akinator also gets the location where you are and links the questions. I have developed my own Akinator named as Ankusha. I have used a pattern matching algorithm. It's quite complicated to say the way Ankusha works. You can get the source code from this github link.
<a href="https://github.com/AnuragSimha/Ankusha-TheMindReader" rel="nofollow noreferrer">Ankusha-The Mind Reader</a>
Ankusha finishes the guess within five questions. He confirms the movie he guessed with you. If you click on 'No', next five questions are asked. This iteration continues up to twenty one questions. It is a Python 3.7 program, which requires the PIL and pygame module to be installed compulsorily. Please do try it out.</p>
<p><strong>NOTE: Make sure that you read the file README.md before proceeding with the installation of the app. All licences are done under the GNU GPLv3 (GNU General Public Licence version 3.0).</strong></p>


<p>It always amazed me how the <a href="https://itunes.apple.com/en/app/akinator-the-genie/id484090401?mt=8" rel="noreferrer">Akinator app</a> could guess a character by asking just several questions. So I wonder what kind of algorithm or method let it do that? Is there a name for that class of algorithms and where can I read more about them?</p>


What kind of algorithm is behind the Akinator game?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋 

腾讯云代码助手

CODING DevOps

Cloud Studio

SDK中心

API中心

命令行工具

它总是让我惊讶的是，是如何通过只问几个问题就猜出一个字符的。所以我想知道什么样的算法或方法能让它做到这一点？这类算法有名字吗?我在哪里可以读到更多关于它们的信息？

问Akinator游戏背后的算法是什么？
EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Akinator游戏背后的算法是什么？EN

回答 7

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问Akinator游戏背后的算法是什么？
EN