Boolean function minifier

Welcome to the boolean function minifier website, this website will brute-force all possible expressions (using AND, OR, NOT and XOR) and come up with an absolute minimal boolean function for a given truth table, which will mostly be substantially shorter than the function given by the Karnaugh Map method.
\(A\) \(B\) \(\text{True}\) \(\text{Don't care}\)
\(0\) \(0\)
\(0\) \(1\)
\(1\) \(0\)
\(1\) \(1\)