How Adversarial Search Works in Chess

Adversarial search is what you would be doing if you were playing a gimp chest with a computer or tic-tac-toe. It then tries to find the optimal move of the opponent and then given the optimal move it then says then what's my optimal move against that move? A simple not great algorithm might be something like how to give points for pieces on the chessboard. Using machine learning you can come up with a better more effective board evaluation algorithm than what a human knows how to program by hand this is a thing yeah.