Skip to content

Commit 48a6f61

Browse files
authored
Update sampleproposal.md
1 parent 008fdaf commit 48a6f61

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

final-proj/sampleproposal.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@ To actually compute the best recipes, we'll simply filter out all the characters
4141
8. *(Stretch)* Map the characters into a high-dimensional vector space and run clustering algorithms to find the best-matching character profiles
4242
9. *(Stretch)* Use generative adversarial networks to generate images of the character's face. Currently I had to draw this myself:
4343
<p align="center">
44-
<img src="Kali.png" style="max-width: 150px" alt="Parth's D&D Character." />
44+
<img src="Kali.png" width="300" alt="Parth's D&D Character." />
4545
</p>
4646

4747
Honestly, the only part we're worried about is the actual algorithm of choosing the best matching character. Can a naive algorithm do "well enough," or do we need to incorporate ML techniques to get reasonable results? We're fairly confident that we can scrape the character data and do the console I/O.

0 commit comments

Comments
 (0)