we consider the problem of finding a hidden clique in a random graph. this problem was studied by alon, krivelevich and sudakov in 1998. using matlab, we wrote two algorithms that are designed to find a hidden clique. one of the algorithms was suggested by the work of alon, krivelevich and sudakov. the other algorithm is a slight variation that seems to perform better in our experiments.