Skip to content

Update README.md #9

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 20, 2025
Merged

Update README.md #9

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -163,6 +163,12 @@ Our implementation of the circle packing problem from the AlphaEvolve paper, whe

[Explore the Circle Packing Example](examples/circle_packing/)

**We have sucessfully replicated the results from the AlphaEvolve paper, below is the packaging found by OpenEvolve after 800 iterations**
![alpha-evolve-replication](https://github.com/user-attachments/assets/1dc9dc95-7519-4742-bce4-ad3a8402635d)

You can see that this is exactly the packaging reported by AlphaEolve in their paper (Figure 14):
![alpha-evolve-results](https://github.com/user-attachments/assets/bcf8d108-a7d1-41e6-bc46-614e354debcd)

### Function Minimization

An example showing how OpenEvolve can transform a simple random search algorithm into a sophisticated simulated annealing approach.
Expand Down Expand Up @@ -190,4 +196,4 @@ If you use OpenEvolve in your research, please cite:
publisher = {GitHub},
url = {https://github.com/codelion/openevolve}
}
```
```