Oh, surprise, surprise. How simple.I'll do some code diving

**tl;dr**

If he only has 3 Tao cities or 5 total cities, we can bribe him with 2 confu

Otherwise it takes 3+ confu cities. I'm pretty sure we would need 3 confu or more.

I'm surprised it has

**nothing to do with population**.

Anyone want to do a test game to confirm?

**Formula:**

N = nPeterCities / 2 (round down). Let's say it'd be half of 6.

**N = 3**

N2 = nPeters

**Tao**Cities - 1. Let's assume he will have 4 Tao cities, so

**N2 = 3**also

AI will refuse due to

**DENIAL_MINORITY_RELIGION**if:

#ConfuCities < min(N, N2)

Code:

```
if (getHasReligionCount(eReligion) < std::min((getHasReligionCount(getStateReligion()) - 1), (getNumCities() / 2)))
{
return DENIAL_MINORITY_RELIGION;
}
```