Skip to content

Latest commit

 

History

History
5 lines (4 loc) · 265 Bytes

File metadata and controls

5 lines (4 loc) · 265 Bytes

Redo the probability calculation for pits in [1,3] and [2,2], assuming that each square contains a pit with probability 0.01, independent of the other squares. What can you say about the relative performance of a logical versus a probabilistic agent in this case?