Skip to content

Latest commit

 

History

History
15 lines (14 loc) · 888 Bytes

README.md

File metadata and controls

15 lines (14 loc) · 888 Bytes
Raw

Computational_Intelligence_For_Optimization

Algorithms for CIFO

Hill Climbing Problem - Numbers (0 to 15 in Binary)


Try to find the best solution to maximize the number of bits setted as 1 in the numbers between 0 and 15 in binary.
Example: Let's supose whe random a number between 0 and 15, and this random number was 5. 5 in binary is 0101. Our goal is to transform this 0101 into 1111 (15) to maximize our result.

Hill Climbing Problem - Mastermind Game

The deal here is to get the local best, not the global best. Sometimes the local is the global best, and sometimes its not. You can set the algorithm to accept blank spaces or repeat colors to make the code harder to break. As you put more iterations better is the chance to get the global best.