Your SlideShare is downloading. ×
0
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Arthur merlin games
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Arthur merlin games

422

Published on

Enumerations Algorithms with Python Generators. Lightning Talk at PythonBrasil[8]

Enumerations Algorithms with Python Generators. Lightning Talk at PythonBrasil[8]

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
422
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
8
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Arthur Merlin GamesPythonBrasil[8] Lightning Talk @fmasanori
  • 2. Arthur Merlin Games• Computational Complexity classic intro• Casar 150 donzelas com 150 cavaleiros• Colocar os 150 cavaleiros em torno da Tavola Redonda• Dois problemas passados para Merlin
  • 3. Casar 150 donzelas• Lista de parceiros “queridos”• 150! possibilidades == 10 ^ 262• Verificando uma possibilidade por segundo temos 10 ^ 255 anos• Idade do universo == 10 ^ 22 anos• 10 ^ 79 protons no mundo• Merlin vai resolver este problema?
  • 4. Small sample Jessica Fernanda Pâmela RenataAdriano Bruno Diogo Eclis Gabriel Leandro Walber No obstruction to the goal in this sample
  • 5. Merlin win!
  • 6. Proof?
  • 7. König theorem jessica Fernanda Pâmela RenataAdriano Bruno Diogo Eclis Gabriel Leandro Walber Subconjunto de donzelas com “queridos” menor Obstruction to the goal == simple certificate
  • 8. Round Table• 150 cavaleiros• Somente vizinhos amigos• Novamente 150! possibilidades• Merlin vai resolver este problema?
  • 9. Round Table with no fight Adriano Leandro Bruno Walber Eclis Gabriel Diogo
  • 10. Problematic Round Table Adriano Walber Bruno Leandro Diogo Gabriel Eclis
  • 11. Proof?
  • 12. Simple obstruction is hard
  • 13. Hamiltonian CircuitProbably no good caracterization
  • 14. Enumeration Algorithms• Enumerar == fazer uma lista de objetos de um determinado tipo• Algoritmos “ruins”• Mas melhor que nada• No generators in C enumeration algorithms• But Python have generators 
  • 15. Demo
  • 16. fmasanori@gmail.comfacebook.com/fmasanori twitter.com/fmasanori

×