Boolean algebra has laws that let you transform expressions. Commutative: A∧B=B∧A and A∨B=B∨A. Order doesn't matter for AND and OR.
Associative: (A∧B)∧C=A∧(B∧C) and (A∨B)∨C=A∨(B∨C). Grouping doesn't matter for chains of the same operator.
Distributive: A∧(B∨C)=(A∧B)∨(A∧C) and A∨(B∧C)=(A∨B)∧(A∨C). You can distribute AND over OR and vice versa.