What does Closing Conversations, Objections and Hand-Overs conclude, in numbers, about “Diagnostic Question Trees: Which Question, and How Many”?
Answer: Chapter 2 solves for the optimal question tree by dynamic programming: ask the situation question first, only 1.73 questions on average, worth 9.0% more than pitching at once; the full-information bound is RM 3,466.
Scope of the numbers: Priors, answer probabilities, close rates, refund rates and costs are illustrative or synthetic; all data are generated by its programs; the book is not legal advice and offers no scripts for manipulating buyers. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 1.73, 9.0
| lost per question | RM per lead | gain | questions asked |
|---|---|---|---|
| 0% | 2,894 | +14.8% | 3.26 |
| 2% | 2,748 | +9.0% | 1.73 |
| 5% | 2,584 | +2.5% | 1.00 |
| 10% | 2,522 | +0.0% | 0.00 |
| 15% | 2,522 | +0.0% | 0.00 |
Show the full program
# Chapter 2. p04: How many questions before the offer? The optimal tree of
# p03 is re-solved for different shares of buyers lost per question, from
# none (a patient buyer) to 15% (a buyer who came for a price). Reported:
# the value per lead, its gain over pitching at once, and the expected
# number of questions the optimal tree asks.
import importlib.util
def load(name):
spec = importlib.util.spec_from_file_location(name, name + ".py")
m = importlib.util.module_from_spec(spec)
spec.loader.exec_module(m)
return m
p03 = load("p03_question_tree")
p01, p02 = p03.p01, p03.p02 # the same module objects p03 uses
if __name__ == "__main__":
prior = dict(p01.PRIOR)
base = p02.value(prior)[1]
print(" lost per question RM per lead gain questions asked")
for d in (0.0, 0.02, 0.05, 0.10, 0.15):
p02.DROP = d
_, v = p03.best(prior, p03.QS)
n = p03.expected_questions(prior, p03.QS)
print(" {:17.0%} {:11,.0f} {:+5.1%} {:15.2f}".format(
d, v, v / base - 1, n))Single source and citation
Fan, Y. (2026). Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics (Version 1.0.0), Chapter 2: Diagnostic Question Trees: Which Question, and How Many. 5D Library. https://doi.org/10.5281/zenodo.24090221
DOI: 10.5281/zenodo.24090221 · Read the monograph · 5DL-B-084 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026084,
author = {Fan, Yafu},
title = {Conversational Closing Automata, Objection-Handling Information Gain and High-Ticket Sales Kinetics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090221},
url = {https://doi.org/10.5281/zenodo.24090221}
}Other chapter answers in this book
- Chapter 1 · What the Buyer Hides, and How Much Each Question Tells
- Chapter 3 · Decoding the Four Classic Objections with Bayes
- Chapter 4 · The Books of High-Pressure Closing: Refunds, Chargebacks and Reputation
- Chapter 5 · When an AI Sales Agent Hands Over to a Human: Gittins Indices and Ranking by Uplift
- Chapter 6 · Trust-Threshold Stopping Rules and Planning the Human Desk
- Chapter 7 · The Guiguzi's "Fan Ying" and "Nei Jian", and Su Qin's Persuasion of Qin in the Zhanguo Ce
- Chapter 8 · A Ledger of Ten Thousand Conversations, Probability Calibration and a Pre-Registered Experiment